- Mon, Jan 11
- Lecture 1: Why are you here? (Moses)
- Wed, Jan 13
- Lecture 2: Asymptotics, Worst-Case Analysis, and MergeSort (Moses)
- Release Homework 1
- Thu, Jan 14
- Section 1 (Jerry; recorded)
- Section 1 (Ofir)
- Fri, Jan 15
- Section 1 (Carrie)
- Wed, Jan 20
- Lecture 3: Solving Recurrences and the Master Theorem (Moses)
- Release Homework 2
- DueHomework 1
- Thu, Jan 21
- Section 2 (Jerry)
- Section 2 (Ofir)
- Fri, Jan 22
- Section 2 (Carrie; recorded)
- Mon, Jan 25
- Lecture 4: Median and Selection (Nima)
- Tue, Jan 26
- Release Homework 3
- Wed, Jan 27
- Lecture 5: Randomized Algorithms and QuickSort (Nima)
- DueHomework 2
- Thu, Jan 28
- Release Exam 1
- Section 3 (Jerry)
- Section 3 (Ofir; recorded)
- Fri, Jan 29
- Section 3 (Carrie)
- Sun, Jan 31
- DueExam 1
- Mon, Feb 1
- Lecture 6: BucketSort and Lower Bounds for Sorting (Moses)
- Wed, Feb 3
- Lecture 7: Binary Search Trees and Red-Black Trees (Moses)
- Release Homework 4
- Thu, Feb 4
- Section 4 (Jerry; recorded)
- Section 4 (Ofir)
- DueHomework 3
- Fri, Feb 5
- Section 4 (Carrie)
- Mon, Feb 8
- Lecture 8: Hashing (Nima)
- Wed, Feb 10
- Lecture 9: Graphs and BFS and DFS (Nima)
- Release Homework 5
- DueHomework 4
- Thu, Feb 11
- Release Exam 2
- Section 5 (Jerry)
- Section 5 (Ofir)
- Fri, Feb 12
- Section 5 (Carrie; recorded)
- Sun, Feb 14
- DueExam 2
- Wed, Feb 17
- Lecture 10: Strongly Connected Components (Nima)
- Release Homework 6
- Thu, Feb 18
- Section 6 (Jerry)
- Section 6 (Ofir; recorded)
- DueHomework 5
- Fri, Feb 19
- Section 6 (Carrie)
- Mon, Feb 22
- Lecture 11: Dijkstra and Bellman-Ford (Moses)
- Wed, Feb 24
- Lecture 12: Dynamic Programming: Bellman-Ford and Floyd-Warshall (Moses)
- DueHomework 7
- Release Homework 7
- DueHomework 6
- Thu, Feb 25
- Section 7 (Jerry; recorded)
- Section 7 (Ofir)
- Sat, Feb 27
- Section 7 (Carrie)
- Mon, Mar 1
- Release Exam 3
- Lecture 13: More Dynamic Programming: LCS, Knapsack, Independent Set (Nima)
- Tue, Mar 2
- DueExam 3
- Wed, Mar 3
- Lecture 14: Greedy Algorithms (Nima)
- Release Homework 8
- Thu, Mar 4
- Section 8 (Jerry)
- Section 8 (Ofir)
- Fri, Mar 5
- Section 8 (Carrie; recorded)
- Mon, Mar 8
- Lecture 15: Minimum Spanning Trees (Moses)
- Wed, Mar 10
- Lecture 16: Min Cuts and Karger's Algorithm (Moses)
- DueHomework 8
- Thu, Mar 11
- Section 9 (Jerry)
- Section 9 (Ofir; recorded)
- Fri, Mar 12
- Section 9 (Carrie)
- Mon, Mar 15
- Release Exam 4
- Lecture 17: Max-Flow and the Ford-Fulkerson Algorithm (Nima)
- Tue, Mar 16
- DueExam 4
- Wed, Mar 17
- Lecture 18: What's next? (Nima)