Review: Improving Quicksort
The real liability of quicksort is that it runs in O(n2) on already-sorted input
Book discusses two solutions:
- Randomize the input array, OR
- Pick a random pivot element
How will these solve the problem?
- By insuring that no particular input can be chosen to make quicksort run in O(n2) time