Lecture 29

Lower Bounds & Linear-time Sorts

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. Lower Bounds: Optimal Solution to Searching/Sorting
  2. Lower Bounds: Comparison-based Algorithms
  3. Comparison-based Algorithm: Decision Tree
  4. Binary Decision Tree
  5. Binary Decision Tree: Analysis
  6. Binary Decision Tree: Linearithmic sorts are optimal!
  7. Linear Sorts: Beating the lower bound
  8. Counting Sort: Integer sorting
  9. More Linear Sorts

Lessons marked with ⚡ contain exercise/activity.