Electrical Engineering and Computer Science
Design and Analysis of Algorithms
Video for Recitation 3 is not available.
Recitation 1: Divide & Conquer: Smarter Interval Scheduling, Master Theorem, Strassen's Algorithm
Recitation 2: B-trees
Recitation 4: Randomization: Randomized Median
Recitation 5: Dynamic Programming: More Examples
Recitation 6: Greedy Algorithms: More Examples
Recitation 7: Incremental Improvement: Applications of Network Flow & Matching
Recitation 8: Complexity: More Reductions
Recitation 9: Complexity: Approximations
Recitation 10: More Distributed Algorithms
Recitation 11: Cryptography: More Primitives
Don't show me this again
This is one of over 2,400 courses on OCW. Explore materials for this course in the pages linked along the left.
MIT OpenCourseWare is a free & open publication of material from thousands of MIT courses, covering the entire MIT curriculum.
No enrollment or registration. Freely browse and use OCW materials at your own pace. There's no signup, and no start or end dates.
Knowledge is your reward. Use OCW to guide your own life-long learning, or to teach others. We don't offer credit or certification for using OCW.
Made for sharing. Download files for later. Send to friends and colleagues. Modify, remix, and reuse (just remember to cite OCW as the source.)
Learn more at Get Started with MIT OpenCourseWare