Design and Analysis of Algorithms

Recitation Notes

REC #	RECITATION NOTES
1	Divide & Conquer: Smarter Interval Scheduling, Master Theorem, Strassen’s Algorithm (PDF)
2	B-trees (PDF)
3	Amortization: Union-find (PDF)
4	Randomization: Randomized Median (PDF)
5	Dynamic Programming: More Examples (PDF)
6	Greedy Algorithms: More Examples (PDF)
7	Incremental Improvement: Applications of Network Flow & Matching (PDF)
8	Complexity: More Reductions (PDF)
9	Complexity: Approximations (PDF)
10	More Distributed Algorithms (PDF)
11	Cryptography: More Primitives (PDF)