| M Jan 13 | Introduction (read Chapters 1-2 for background) |
| W Jan 15 | Calculus of Finite Differences; read slides. |
| W Jan 15 | Flipped: Asymptotic Notations. |
| F Jan 17 | FD Calculus. Asymptotic Notations; read slides and Chapter 3. |
| M Jan 20 | No class. MLK holiday. |
| W Jan 22 | FD Calculus. Sorting Lower Bound; read slides and Chapter 8.1. |
| W Jan 22 | Flipped: LaTeX video (optional, for those w/o LaTeX background) |
| F Jan 24 | Adversarial Lower Bounds. |
| M Jan 27 | Adversarial Lower Bounds. Divide and Conquer; read Chapter 4. |
| M Jan 27 | Flipped: Divide and Conquer (esp. Master's theorem, Karatsuba's rec. alg.) |
| T Jan 28 | Flipped: Finding the 2nd Largest Element |
| W Jan 29 | Master Theorem. Strassen's Matrix Multiplication; read Chapter 4.2. |
| W Jan 29 | Flipped: Strassen's matrix multiplication (review) |
| R Jan 30 | Flipped: Fast Fourier Transform, Part I |
| F Jan 31 | Divide and Conquer. Fast Fourier Transform; read Chapter 30. |
| F Jan 31 | Flipped: Fast Fourier Transform, Part II |
| M Feb 3 | Fast Fourier Transform |
| W Feb 5 | Fast Fourier Transform |
| W Feb 5 | Flipped: Greedy Algorithms: Giving Change |
| F Feb 7 | Greedy Algorithms: Giving Change |
| M Feb 10 | Greedy Algorithms and Matroids |
| M Feb 10 | Flipped: Greedy Algorithms and Matroids video (review) |
| W Feb 12 | Greedy Algorithms and Matroids |
| F Feb 14 | Bipartite Matching |
| F Feb 14 | Flipped: Bipartite Matching video (review) |
| F Feb 14 | Flipped: Dynamic Programming video (watch before Monday!) |
| M Feb 17 | Dynamic Programming: Giving Change |
| W Feb 19 | Dynamic Programming: Longest Common Subsequence |
| W Feb 19 | Flipped: Matrix Chain video |
| F Feb 21 | Review |
| M Feb 24 | Review |
| W Feb 26 | Midterm Exam |
| F Feb 28 | Amortized Analysis |
| F Feb 28 | Flipped: Amortized Analysis of the Multipop Stack (optional, review) |
| F Feb 28 | Flipped: Amortized Analysis of vector::push_back |
| M Mar 03 | Amortized Analysis |
| W Mar 05 | Graph Algorithms |
| W Mar 05 | Flipped: Topological Sorting video |
| F Mar 07 | Graph Algorithms |
| F Mar 07 | Flipped: Strongly Connected Components video (review) |
| Mar 10-14 | Spring Break |
| M Mar 17 | Graph Algorithms |
| W Mar 19 | Graph Algorithms: Shortest Path Algorithms |
| F Mar 21 | Randomized Algorithms: Basics of Probability Theory |
| F Mar 21 | Flipped: Probability Theory (review) |
| M Mar 24 | Randomized Algorithms: Minimum Cut |
| W Mar 26 | Randomized Algorithms: Quicksort |
| F Mar 28 | Randomized Algorithms: Randomized Selection |
| M Mar 31 | Randomized Algorithms: Birthday Problems |
| W Apr 02 | Randomized Algorithms: Randomized Selection Exercise |
| F Apr 04 | Randomized Algorithms: 2SAT |
| M Apr 07 | Complexity Theory: The Complexity Classes P and NP |
| W Apr 09 | Complexity Theory: NP-Completeness |
| F Apr 11 | Complexity Theory: NP-Completeness of SAT and 3SAT |
| F Apr 11 | Flipped: Read Chapter 34 in CLRS |
| M Apr 14 | Complexity Theory: NP-Completeness of VC, Clique, Independent Set |
| W Apr 16 | Complexity Theory: NP-Completeness of Combinatorial Problems |
| F Apr 18 | No Class |
| M Apr 21 | Complexity Theory: Approximation Algorithms |
| W Apr 23 | Approximation Algorithms, Undecidability |
| F Apr 25 | Undecidability |