clrs; exercise 7.4.1 - split recurrence is Ω(n²)
clrs; exercise 7.4.2 - best-case Ω(nlgn)
clrs; exercise 7.4.3 - q² + (n - q - 1)² maximum
clrs; exercise 7.4.4 - expected time Ω(nlgn)
clrs; exercise 7.4.5 - quicksort/insertion-sort
clrs; exercise 7.4.6 - median-of-3 bad split probability
clrs; problem 7.1 - Hoare partitioning correctness