Recitation 1 (August 24): LaTeX
See the Resources tab for more LaTeX resources.
Recitation 2 (August 31): Proof Practice
Recitation 3 (September 7): Asymptotic Time Complexity
Recitation 4 (September 14): Cancelled
Recitation 5 (September 21): Divide and Conquer Algorithms
Recitation 6 (September 28): Dynamic Programming
Recitation 7 (October 5): Review DP problems
Recitation 8 (October 12): Knapsack problem
Recitation 9 (October 19): Homework help
Recitation 10 (October 26): Greedy algorithms
Recitation 11 (November 2): DFS and topological sort
Recitation 12 (November 9): Strongly connected components
Recitation 13 (November 16): Homework help
Recitation 14 (November 30): Applications of maximum flow