Lectures: MW 5:30--6:55pm, FIT 225.
| Lecture | Date | Notes |
|---|---|---|
| 1 | 1/18 | Introduction |
| 2 | 1/23 | Algorithm analysis |
| 3 | 1/25 | Algorithm analysis II, Growth of functions |
| 4 | 1/30 | Time complexity function |
| 5 | 2/1 | Recurrence |
| 7 | 2/8 | Sorting I |
| 8 | 2/13 | Sorting II |
| 9 | 2/15 | Sorting III |
| 10 | 2/20 | Selection |
| 11 | 2/22 | Selection II |
| 12 | 2/27 | Graph I |
| 13 | 3/15 | Graph II |
| 14 | 3/20 | Graph optimization and Greedy I |
| 15 | 3/22 | Graph optimization and Greedy II |
| 16 | 3/29 | Dynamic programming I |
| 18 | 4/12 | NP-completeness I |
| 19 | 4/17 | NP-completeness II |
| 20 | 4/24 | String matching |