Agenda

  1. Warm-up: Trace It — a nested loop over a grid
  2. Problem of the day: shortest path through a grid with obstacles, solved by hand before it is coded
  3. Compare and name it: a queue as the engine of a breadth-first search. Stacks and Queues earns its keep

Things to do before our next class

  • Journal: why a stack and a queue give different searches.