Design and Analysis of Algorithms (6.046J)

Designing efficient algorithms

This intermediate algorithms course focuses on how to design efficient solutions and how to analyze them. The emphasis is on methods and on applying them to new problems.

Techniques in the syllabus

• Divide-and-conquer
• Randomization
• Dynamic programming
• Greedy algorithms and incremental improvement

Where it leads

Complexity and cryptography round out the list of topics, so the course reaches beyond pure algorithm design. It suits readers who have a working grasp of algorithms and want to sharpen their design instincts. Because the course is organized around methods rather than a catalogue of algorithms, the same techniques reappear across very different problems, which is where the lessons stick.