2 ms·
It's usually quicksorting a linked list, where a random pivot, median of three, etc. are terrible for performance. (Merge sort is of course the natural sort fo
by shawn_w 1y ago
It's usually quicksorting a linked list, where a random pivot, median of three, etc. are terrible for performance.
(Merge sort is of course the natural sort for lists, but qs is like 2 lines of Haskell so it gets demoed for being clever)