6.1220J / 18.410J Design and Analysis of Algorithms
Repeats every week every Tuesday and every Thursday until Tue Dec 09 2025 except Tue Nov 11 2025, Thu Nov 27 2025.
Thu, 09/04/2025 - 11:00am to 12:30pmLocation:
34-101
Instructor:
Charles Leiserson, Srinivasan Raghuraman, Virginia Vassilevska Williams
Techniques for the design and analysis of efficient algorithms, emphasizing methods useful in practice. Topics include sorting; search trees, heaps, and hashing; divide-and-conquer; dynamic programming; greedy algorithms; amortized analysis; graph algorithms; and shortest paths. Advanced topics may include network flow; computational geometry; number-theoretic algorithms; polynomial and matrix calculations; caching; and parallel computing.