Re: How much time does it need to sort 1 million random 64-bit/32-bit integers?

Dann Corbit wrote:

If there is any interest I could publish the code so that others could
try it out on other systems (but it uses the x86 time stamp counter for
timing).

I would like to play with the code. It will be interesting to compare
against:
http://www.nada.kth.se/~snilsson/public/papers/sorting/
and:
http://portal.acm.org/supp_gateway.cfm?id=944623&type=tar&path=%2F950000%2F944623%2Fsupp%2Fp5%2Dedelkamp%2Etar&coll=GUIDE&dl=GUIDE&CFID=982533&CFTOKEN=70653081

Along with a few others.

I have put the code I used here and will leave it in place for a few days:

http://fp.gladman.plus.com/computing/sort.zip

I should stress that this is just stuff I have played with and not code
that I have spent a lot of time on (my interest was initially raised by
Paul Hsieh's comments on heapsort versus quicksort for small sorting
tasks).

I would be interested in any results on other systems.

Brian Gladman
.