II Sorting and Order Statistics
6 Heapsort
6.1 Heaps . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
6.2 Maintaining the heap property . . . . . . . . . . . . . . . . . . . . . . . . . . .
6.3 Building a heap . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
6.4 The heapsort algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
6.5 Priority queues . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
7 Quicksort
7.1 Description of quicksort . . . . . . .
7.2 Description of quicksort . . . . . . .
7.3 Performance of quicksort . . . . . .
7.4 A randomized version of quicksort .
7.5 Analysis of quicksort . . . . . . . . . .
8 Sorting in Linear Time
8.1 Lower bounds for sorting
8.2 Counting sort . . . . . . .
8.3 Radix sort . . . . . . . . .
8.4 Bucket sort . . . . . . . . . .
9 Median and Order Statistics
9.1 Minimum and Maximum . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
9.2 Selection in expected linear time . . . . . . . . . . . . . . . . . . . . . . . . .
9.3 Selection in worst-case linear time . . . . . . . . . . . . . . . . . . . . . . . .