2010-10-21, 09:09 PM
Hazzy Wrote:Assuming the animations reflect time consumption... is there any reason to use one other than Quick Sort?
Does not reflect time consumption.
A combination of Mergesort and Quicksort is usually done whenever you do a sort in java, python, c or any other language really.
For integers, radix sort is quite fast. For partly sorted arrays, smoothsort is the way to go. As Spaz said, what algorithm you decide to use depends on the constraints you have.

