Lecture 21


Learning Outcomes

At the end of this lecture, you’ll be able to:

Lecture Plan

In this lecture, we'll cover the following lessons:

  1. PriorityQueue: Sort
  2. PriorityQueue: Efficiency of Sort
  3. Heapsort
  4. Heapsort: Floyd's Heapify
  5. Floyd's Heapify: Exercise
  6. Complete Binary Tree Interlude: Number of Leaves
  7. Floyd's Heapify: A Linear Time Operation
  8. Heapsort: In-place Sorting
  9. Heapsort: Putting it together!
  10. PriorityQueue Aside: Selection Problem
  11. PriorityQueue Aside: Linked Tree Representation

Lessons marked with ⚡ contain exercise/activity.