6.1220J / 18.410J Design and Analysis of Algorithms
Repeats every week every Tuesday and every Thursday until Tue May 12 2026 except Tue Feb 17 2026, Tue Mar 24 2026, Thu Mar 26 2026.
Tue, 02/03/2026 - 11:00am to 12:30pmLocation:
32-123
Instructor:
Kuikui Liu, Srinivasan Raghuraman, Julian Shun
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.