| Date | Topic | Reading | Assignment | Misc |
|---|
| 2/12 | introduction (.tex) | Ch. 1, 2 | assignment 1 (.tex)
clrscode.sty | |
| 2/14 | big-O (ppt) | Ch. 3 | assignment 2 (.tex) | |
| 2/19 | recurrences (ppt) | Ch. 4-4.1, 4.3-4.5 | assignment 3 (.tex) | |
| 2/21 | quicksort, randomized algorithms (ppt) | Ch. 7 | assignment 4 (.tex) | |
| 2/26 | sorting conclusions (ppt)
linear sorting | Ch. 8 | assignment 5 (.tex) | |
| 2/28 | order statistics (ppt),
basic data structures (ppt) | Ch. 9, 10 | assignment 6 (.tex) | |
| 3/5 | amortized analysis, heaps (ppt) | Ch. 6, Ch. 17.1 | assignment 7 (.tex) | |
| 3/7 | heaps (ppt), binomial heaps (ppt) | Ch. 19-19.3 | assignment 8 (.tex) | |
| 3/12 | binary search trees (ppt) | Ch. 12, 18 | assignment 9 (.tex) | |
| 3/14 | B-trees (ppt), disjoint sets | Ch. 21.1-21.2 | assignment 10 (.tex) | |
| 3/19 | review (ppt) | | | midterm |
| 3/21 | hashtables (ppt) | Ch. 11, except 11.3.3, 11.5 | | |
| 3/26 | BREAK | | | |
| 3/28 | BREAK | | | |
| 4/2 | greedy algorithms (ppt) | Ch. 16-16.3 | assignment 11 (.tex) | |
| 4/4 | more greedy (ppt) | | assignment 12 (.tex) | |
| 4/9 | dynamic programming (ppt) | Ch. 15-15.4 | assignment 13 (.tex) | |
| 4/11 | dynamic programming (ppt) | Ch. 15.5 | assignment 14 (.tex) | |
| 4/16 | graph basics (ppt) | Ch. 22 | assignment 15 (.tex) | |
| 4/18 | shortest paths (ppt) | Ch. 24-24.3 | assignment 16 (.tex) | |
| 4/23 | minimum spanning trees (ppt) | Ch. 23 | assignment 17 (.tex) | |
| 4/25 | network flow (ppt) | Ch. 26-26.2 | assignment 18 (.tex) | |
| 4/30 | flow applications (ppt) | Ch. 26.3 | assignment 19 (.tex) | |
| 5/2 | NP-completeness (ppt) | Ch. 24 | assignment 20 (.tex) | |
| 5/7 | NP-complete reductions (ppt) | | assignment 21 (.tex) | |
| 5/9 | review (ppt) | | | final |