### Section Notes

Section 1: PDF -- Big-Oh, the Master Theorem, and MergeSort (solutions)

Section 2: PDF -- Heaps and DFS (solutions)

Section 3: PDF -- Shortest Paths and MSTs (solutions)

Quiz 1 Review: PDF (solutions)

Section 4: PDF -- Union-Find and MSTs (solutions)

Section 5: PDF -- Greedy Algorithms (solutions)

Section 6: PDF -- Divide and Conquer, Fast Fourier Transform (solutions)

Section 7: PDF -- Dynamic Programming and Randomization (solutions)

Quiz 2 Review: PDF (solutions)

Section 8: PDF -- Hashings, Skip Lists (solutions)

Section 9: PDF -- Karger-Stein, Counting Bloom Filters, Random Walks (solutions)

Section 10: PDF -- Network Flows and Linear Programming (solutions)

Section 11: PDF -- Zero-Sum Games and NP-Completeness (solutions)

Final Review:

PDF -- Final Exam Topic List