Analyzing Quicksort: Average Case
Intuitively, a real-life run of quicksort will produce a mix of “bad” and “good” splits
- Randomly distributed among the recursion tree
- Pretend for intuition that they alternate between best-case (n/2 : n/2) and worst-case (n-1 : 1)
- What happens if we bad-split root node, then good-split the resulting size (n-1) node?