clrs; exercise 7.1.1 - illustrate PARTITION
clrs; exercise 7.1.2 - PARTITION w/ the same elements
clrs; exercise 7.1.3 - PARTITION running time argument
clrs; exercise 7.1.4 - nondecreasing sorting
clrs; fix some typos in problem 2.4
clrs; exercise 7.2.1 - T(n) = T(n-1) + Θ(n) ⇒ Θ(n²)
clrs; exercise 7.2.2 - QUICKSORT w/ the same elements
clrs; exercise 7.2.3 - QUICKSORT on reverse-sorted array
clrs; exercise 7.2.4 - QUICKSORT vs INSERTION-SORT
clrs; exercise 7.2.5 - min/max depth in α/(1-α) split
clrs; exercise 7.2.6 - Pr{split > α/(1-α)}