Hacker News new | ask | show | jobs
Exploring the Worst Case Complexity of Quicksort (2015) (tyler-davis.com)
20 points by 10000100001010 2846 days ago
4 comments

The textbook solution is to use this pivot selection algorithm:

https://en.wikipedia.org/wiki/Median_of_medians

In practice it is not really worth it.

No matter how clever you are with an algorithm, somebody wrote a paper on it in the 70s.
The light grey text with the white background, seems to be a popular design choice. But I have trouble reading this page do to the lack of contrast.
This was just as ridiculously nerdy as it was when friends of mine from school and I did it in 1981 -- in basic on the trs80 though :D
Was that Level I or Level II BASIC? ;)