In this section and the next, two less obvious but faster sorts are considered. These two sorts, heapsort and quicksort, were developed from different points of view and as a result have different advantages.
8.4.3 Timing the Heap Creation
8.4.5 Some Details of Heap Implementation
8.4.7 An Implementation for Heapsort
8.4.8 Heapsort is Uniformly Fast