Reading¶
- Transform and Conquer - Notes compiled from the Levitin textbook.
- OpenDSA: Heaps and Priority Queues and/or DS&AA: Section 5.5
- OpenDSA: Heapsort and/or DS&AA: Section 7.6
Supplemental¶
- Aho & Ullman: 5.9-5.10 [PDF] - Priority Queues; Heapsort
- Preiss: Heaps and Priority Queues
Levitin¶
- Levitin 6.0-6.1
- Pre-sorting: Checking uniqueness, computing the mode, search (enabling binary search)
- Levitin 6.4
- Heaps, Heapsort