| M Aug 26 | Introduction (read Chapters 1-2 for background) |
| W Aug 28 | Introduction (Explore e: Solution) |
| W Aug 28 | Flipped: LaTeX video |
| R Aug 29 | Flipped: Asymptotics video; read Chapter 3 |
| F Aug 30 | Introduction, Asymptotic Notations, Sorting Lower Bound; read Chapter 8.1 |
| M Sep 02 | Adversarial Lower Bounds; study slides |
| W Sep 04 | Divide and conquer; read Chapter 4 |
| W Sep 04 | Flipped: Divide-and-conquer (review, new parts towards the end) |
| F Sep 06 | Karatsuba's integer multiplication; watch divide and conquer video |
| F Sep 06 | Flipped: Strassen's matrix multiplication |
| M Sep 09 | Strassen's matrix multiplication; slides and Chapter 4.2 |
| W Sep 11 | Fast Fourier Transform; watch FFT video |
| R Sep 12 | Flipped: Fast Fourier Transform, Part I (review) |
| R Sep 12 | Flipped: Fast Fourier Transform, Part II (watch!) |
| F Sep 13 | Fast Fourier Transform; read Chapter 30 |
| M Sep 16 | Fast Fourier Transform |
| T Sep 17 | Flipped: Giving Change video |
| W Sep 18 | Greedy Algorithms |
| W Sep 18 | Flipped: Greedy Algorithms and Matroids video |
| F Sep 20 | Greedy Algorithms and Matroids |
| M Sep 23 | Greedy Algorithms and Matroids |
| W Sep 25 | Bipartite Matching |
| R Sep 26 | Flipped: Bipartite Matching video (review) |
| R Sep 26 | Flipped: Dynamic Programming video |
| F Sep 27 | Dynamic Programming; watch DP video and read Chapter 15 |
| M Sep 30 | Longest Common Subsequence |
| W Oct 02 | Class does not meet; watch lecture on the Matrix Chain Problem |
| F Oct 04 | Review |
| M Oct 07 | Review |
| W Oct 09 | Midterm Exam |
| W Oct 09 | Flipped: Amortized Analysis of the Multipop Stack video |
| F Oct 11 | Exam Solution; Amortized Analysis |
| M Oct 14 | Amortized Analysis |
| T Oct 15 | Flipped: Amortized Analysis of vector::push_back video (review) |
| W Oct 16 | Amortized Analysis |
| F Oct 18 | Graph Algorithms: Breadth-First Search |
| M Oct 21 | Graph Algorithms: Depth-First Search |
| W Oct 23 | Graph Algorithms: Topological Sorting |
| W Oct 23 | Flipped: Topological Sorting video (review) |
| F Oct 25 | Graph Algorithms: Strongly Connected Components |
| F Oct 25 | Flipped: Strongly Connected Components video (review) |
| M Oct 28 | Graph Algorithms: Dijkstra's Single Source Shortest Path Algorithm |
| W Oct 30 | Graph Algorithms: Bellman-Ford |
| F Nov 01 | Randomized Algorithms, Basics of Probability Theory |
| M Nov 04 | Randomized Algorithms, Minimum Cut Algorithm |
| M Nov 04 | Flipped: The Birthday Problem video |
| W Nov 06 | Randomized Algorithms, Minimum Cut Algorithm, Random Subsets |
| F Nov 08 | Flipped: Probability Theory (review) |
| F Nov 08 | Randomized Algorithms, Quicksort, Random Variables |
| M Nov 11 | Randomized Algorithms, Randomized Selection |
| W Nov 13 | Randomized Algorithms, Randomized Selection |
| F Nov 15 | Randomized Algorithms, Birthday Problems |
| M Nov 18 | Complexity Theory: The Complexity Classes P and NP |
| W Nov 20 | Complexity Theory: Polynomial-Time Reductions, NP-Completeness |
| F Nov 22 | Complexity Theory: NP-Completeness, Exploration |
| F Nov 22 | Flipped: 3SAT video |
| M Nov 25 | Complexity Theory, Comparison of Selection Sort Programs |
| W Nov 27 | Flipped: Undecidability video, class does not meet |
| F Nov 29 | No class |
| M Dec 02 | Review |