logoalt Hacker News

gnullyesterday at 9:52 AM0 repliesview on HN

Btw, you can make quicksort deterministically O(n log n) if you pick the pivot point with linear median search algorithm. It's impressive how randomness lets you pick a balanced pivot, but even more impressive that you could do the same without randomness.