News for hackers. Stuff that matters.
Re:Illustrated Sorting Algorithms by RogerL on Saturday April 26, 2014 @10:52PM (#7653710)
Yes, sometimes, but it also uses more memory. In practice, with real problems, quicksort wins with in-memory sorting, and mergesort wins with too big for memory data sets.

There are no comments on this comment yet.