Recitation 1: LaTeX (August 25)
See the Resources tab for more LaTeX resources.
Recitation 2: Proof Practice (September 1)
Recitation 3: Asymptotic Time Complexity (September 8)
Recitation 4: Divide and Conquer Algorithms (September 15)
Recitation 5: Cancelled (September 22)
Recitation 6: Dynamic Programming (September 29)
Recitation 7: Greedy Algorithms (October 6)
Recitation 8: Overview of Recursive Strategies (October 13)
Recitation 9: Red-Black Trees (October 20)
Recitations 10-11: Disjoint Set Data Structures (October 27/November 3)
Recitation 12: Strongly Connected Components (November 10)
Recitation 13: MSTs and Shortest Paths (November 17)