| Date | Day | Lecture | Topic | Reading | Due |
| 31-Jan | M | 1 | Introduction & Order of Growth | 1.1-2.2 | |
| 2-Feb | W | 2 | Summations & Analysis of Loop Algorithms | 3.1-3.2 | |
| 7-Feb | M | 3 | Recurrences & Analysis of Recursive Algorithms | 4.1-4.2 | HW 1 Due |
| 9-Feb | W | 4 | The Master Theorem | 4.3 | |
| 14-Feb | M | 5 | Sorting I: Heapsort | 7.1-7.5 | HW 2 Due |
| 16-Feb | W | 6 | Sorting II: Quicksort | 8.1-8.4 | |
| 21-Feb | M | 7 | Sorting III: Lower Bounds & Linear Sorting | 9.1-9.4 | HW 3 Due |
| 23-Feb | W | 8 | Order Statistics | 10.1-10.3 | |
| 28-Feb | M | 9 | Exam I | ||
| 1-Mar | W | 10 | Exam I Discussion | ||
| 6-Mar | M | 11 | Hashing I | 12.1-12.2 | HW 4 Due |
| 8-Mar | W | 12 | Hashing II | 12.3-12.4 | |
| 13-Mar | M | 13 | Red-Black Trees | 14.1-14.4 | HW 5 Due |
| 15-Mar | W | 14 | Dynamic Programming | 16.1-16.2 | |
| 20-Mar | M | Spring Break | |||
| 22-Mar | W | Spring Break | |||
| 27-Mar | M | 15 | Dynamic Programming | 16.3-16.4 | HW 6 Due |
| 29-Mar | W | 16 | Dynamic Programming | ||
| 3-Apr | M | 17 | Exam II | ||
| 5-Apr | W | 18 | Exam II Discussion | ||
| 10-Apr | M | 19 | Union-Find & Disjoint Sets | 22.1-22.3 | HW 7 Due |
| 12-Apr | W | 20 | Graphs, Breadth-First & Depth-First Search | 23.1-23.3 | |
| 17-Apr | M | 21 | Topological Sorting & Connected Components | 23.3-23.4 | HW 8 Due |
| 19-Apr | W | 22 | Minimum Spanning Trees | 24.1-24.2 | |
| 24-Apr | M | 23 | Single Source Shortest Paths I | 25.1-25.2 | HW 9 Due |
| 26-Apr | W | 24 | Single Source Shortest Paths I | 25.3-25.4 | |
| 1-May | M | 25 | All-Pairs Shortest Paths I | 26.1-26.2 | HW 10 Due |
| 3-May | W | 26 | All-Pairs Shortest Paths II | 26.3 | |
| 8-May | M | 27 | Greedy Algorithms | 17.1-17.3 | HW 11 Due |
| 10-May | W | 28 | Special Topic TBA | ||
| 15-May | M | 29 | Review | Project Due | |
| 16-May | Tue | Last Day Of Classes |