News for hackers. Stuff that matters.

A comment on Illustrated Sorting Algorithms. Parent comment

Re:Illustrated Sorting Algorithms by mjcohen on Saturday April 26, 2014 @09:11PM (#7653452)
It's simple(relatively) and almost always quite fast. Or would you rather use slowsort?
[ Parent | on HN ]
Re:Illustrated Sorting Algorithms by TheLoneWolfling on Saturday April 26, 2014 @09:36PM (#7653526)
Quicksort is not simple if you have to build in an entire other sorting algorithm as a failsafe.

And merge sort is often faster, especially if the comparison function is relatively expensive.

[ Parent | on HN ]
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.
[ Parent | on HN ]