Re:Illustrated Sorting Algorithms
by cvbncvbncgbc on Sunday April 27, 2014 @05:13AM
(#7654464)
Calling it fastest is not fair. Timsort appears to be very fast because most real world data we operate it on is somewhat sorted, but requires O(n) extra memory. It simply depends on the situation and data.
[ Parent
| on HN ]
There are no comments on this comment yet.