Algorithm Analysis
Taught by James Anderson
Text: Introduction to Algorithms, 2nd ed.by Cormen, Leiserson, Rivest and Stein

This class was pure paper and pencil. Jim required us to be very clear and complete in our proofs. We covered the following chapters in depth: 7 Quicksort, 18 B-Trees, 19 Binomial Heaps, 21 Data Structures for Disjoint Sets, 24 (Review) Dijkstra’s and Bellman-Ford Algorithms, 25 All-Pairs Shortest Paths, 26 Maximum Flow, 34 NP-Complete and Related Problem Classes, 35 Approximation Algorithms; and the following in less depth: 29 Linear Programming, 30 Polynomials and the FFT, 32 String Matching. Busy class. Not much of a webpage….