QuickSort, due to Hoare, is one of the best comparison-based sorting algorithms around. There are a number of variations, but the vanilla QuickSort does a great job… most of the times.
Indeed, there are occasions where QuickSort leaves its expected 
Foiled!
March 16, 2010
4 Comments | 
algorithms, hacks, Mathematics, programming, rants, theoretical computer science, wtf | Tagged: bubble sort, C, comparison sort, computational complexity, evil, Hoare, malicious data, QuickSort, sort, sorts, Worst Case, Worst Case Behavior | 
Permalink
Posted by Steven Pigeon
