Random commentary about C++, STL, Boost, Perl, Python, Algorithms, Problem Solving and Web Search
Tuesday, March 2, 2010
Traditionally quicksort is considered quadratic in the worst case. there is a randomized version which makes it O(n log n). Do you know how to make it O(n log n) worst case without using randomization?