We saw a proof that 2^n grows more quickly than n^2. We then walked through examples of algorithms analysis, covering most of the algorithms in chapter 15. The exception is Karatsuba's algorithm, which we'll cover next Tuesday.
Towers of Hanoi demos
Sorting algorithm comparison
