What is the best algorithm to sort a million 32 bit integers (each unique and ranging from 1-1000000)? I think timsort does it, but how does quicksort or mergesort or some other sorting algorithm compare with respect to the task?

Question

anonymous · Answer

CS question?

anonymous · Answer

Yeah.

anonymous · Answer

so post it there :P

anonymous · Answer

but maybe JamesJ knows the answer.

anonymous · Answer

you can ask him in chat! tadam

anonymous · Answer

because Mathematics and Computer Science are like non-identical twins.

anonymous · Answer

.... siblings! that's the word

anonymous · Answer

BINARY SEARCH WOULD BE THE MOST SUITABLE FOR SUCH A LARGE NUMBER OF DATA

anonymous · Answer

It won't be effective on an unsorted list :-P

anonymous · Answer

The task is to sort a list, not to search for an element in the list.

anonymous · Answer

oh, sorry!
for sorting, i think quick sort would be good....

anonymous · Answer

you check it @ http://en.wikipedia.org/wiki/Sorting_algorithm to view which on is more effective on what basis

anonymous · Answer

don't think!
justify! :D

anonymous · Answer

every sorting algorithms have few advantages and many disadvantages.....you can compare all the algorithms which one is more effective on what basis @ wikipedia http://en.wikipedia.org/wiki/Sorting_algorithm

anonymous · Answer

I think timsort would be the way to go: http://svn.python.org/projects/python/trunk/Objects/listobject.c

anonymous · Answer

that code is for Lists in Python (written in C)