| Unit |
PPT slides |
| 1: Preliminaries |
 (1477KB) |
| 2: Complexity and summations |
(1477KB) |
| 3: Recurrence equations |
(1477KB) |
| 4: Recurrence equations (continued) |
(1477KB) |
| 5: Probability and randomized algorithms |
(1477KB) |
| 6: Sorting basics |
(1477KB) |
| 7: Heapsort |
(1477KB) |
| 8: Quicksort |
(1477KB) |
| 9: Linear-time sorts |
(1477KB) |
| 10: Selection algorithms |
(1477KB) |
| 11: Hashing |
(1477KB) |
| 12: Hashing (continued) |
(1477KB) |
| 13: Binary search trees |
(1477KB) |
| Midterm Exam |
(1477KB) |
| 14: Red-black trees |
(1477KB) |
| 15: Augmenting data structures |
(1477KB) |
| 16: Dynamic programming |
(1477KB) |
| 17: Greedy algorithms |
(1477KB) |
| 18: Amortized analysis |
(1477KB) |
| 19: Graphs |
(1477KB) |
| 20: Breadth-first search |
(1477KB) |
| 21: Depth-first search |
(1477KB) |
| 22: Connected components |
(1477KB) |
| 23: Disjoint sets |
(1477KB) |
| 24: Minimum spanning trees |
(1477KB) |
| 25: Single-source shortest paths |
(1477KB) |
| 26: Constraint systems |
(1477KB) |
| 27: Course review |
(1477KB) |
