Outline:

0. Questions?
1. Review: “easy” problems
   • searching: algorithms and runtimes
   • sorting: algorithms and runtimes
2. “Hard” problems
   • review: Bin Packing and Knapsack
   • another intractable problem: Towers of Hanoi
   • an unsolvable problem: The Halting Problem

Reading assignment (to be completed before the final):

• Zelle sections 14.4–14.5 (pp. 498–508)