Problems 4.7 and 4.9: implement a MergeSort, in place and without recursion, storing the list in a simple array.
Problem 4.10 on Quicksort.
Problems 4.18, 4.19, and 4.20 on heaps and priority queues.
Problem 4.25 on radix sorts