It depends on the use cases. If you have less elements of order of( say 100) then even insertion sort can be a better choice. It's in-place sorting algo and can perform sorting as it receives the elements like a stream.
If you have large number of elements and all the elements can't be accommodated in the system memory together than merge sort is the only best choice. If you have large number of elements and can be accommodated in the memory together then on an average quicksort is what you should look at. On Thu, Sep 8, 2011 at 11:22 PM, praveen raj <praveen0...@gmail.com> wrote: > Merge sort > Quicksort--number of comparisons and exchanges lesser than heapsort...if > worst case not occurs... > > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to algogeeks@googlegroups.com. > To unsubscribe from this group, send email to > algogeeks+unsubscr...@googlegroups.com. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
