UPCOMING: hw5 written (do 3) is due by 5pm today.  I'll release
solutions to these problems at our (optional) review session, 11am
Wednesday in W302.  Our final exam is 4:30-7pm Friday in our usual
room, you may prepare one sheet of notes to use during the exam.

Today we will not have any new material, just some general review and
(stopping early) and class evaluations.

All "recent" material (lectures and homework since midterm) is fair
game for the exam.  The "share" directory is a good summary.  This
includes the latter part of Chapter 4 (MST and shortest paths), lots
of Chapter 5 (strings), and some bits of Chapter 6 (reductions).
Note a few topics (Quadtree, TSP, Manber, BWT, LP) are in share
(notes/slides, etc), without much mention in the textbook.

These older topics will not be on the exam, except just as basic
building blocks in our more recent topics (e.g. in MST, etc):
  * UF
  * binary heaps, comparison sorting
  * BSTs, red-black trees
  * hashing
  * DFS/BFS/SCC

Two exceptions:

 1. The "indexed" version of the MinHeap, since we had to use that a
    couple of times, and it has that clever internal "inverse" array
    (with both pq and qp).

 2. The lower bound for comparison sorting, but now in the context
    that we are "breaking" that bound with key-indexed operations.