Nov 13

We’ll be looking at search and complexity today with examples on the board.

The best presentations of this material that I’ve found are:

Linear and Binary Search

and

Hash Functions and Fast Lookup