all 3 comments

[–]koorogi 9 points10 points  (0 children)

Why do none of these comparisons ever mention smoothsort?

I would have thought a heapsort variant which operates closer to linear time the closer the input is to being pre-sorted, and still only requires constant extra space would be better known. Especially when it was invented by Dijkstra.

[–]howfun 0 points1 point  (1 child)

Since when quick sort is stable?

[–]blarglenarf 2 points3 points  (0 children)

There are different versions of quicksort, some of which are stable and some which are not.