Open Course Space

Design and Analysis of Algorithms

Massachusetts Institute of TechnologyUnited States6.046J
Free, no sign-up neededSpring 2015English
Go to course on MIT OpenCourseWare All 3 ways to take it

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.

Description from MIT OpenCourseWare.

Ways to take this course