Re: "Sorting" assignment


"Bartc" <bc@xxxxxxxxxx> wrote in message
I'd made a claim in this thread that bubble sort's speed might be acceptable
for N in the hundreds. My test (on simple memory-based data and on my
machine) showed this could well be true.

Generally if the number of operations is trivial, you'll start to notice an N^2 algorithm at N = 1000. It means 1 million operations, or say 100 million machine instructions, which is a fraction of a second on a 3GHz machine. You'll just notice the screen flicker as it updates.

--
Free games and programming goodies.
http://www.personal.leeds.ac.uk/~bgy1mm

.