查找与排序

Chapter 6 Heapsort

• Maintaining the heap property
• Building a heap
• The heapsort algorithm
• Priority queues

Chapter 7 Quicksort

• Description and Performance
• A randomized version of quicksort
• Analysis of quicksort

Chapter 8 Sorting in Linear Time*

Chapter 9 Medians and Order Statistics

• Minimum and maximum
• Selection in expected linear time