Introduction to Algorithms
MIT 6.046J
18.410J
SMA 5503
Fall 2005
This course teaches techniques for the design and analysis of efficient algorithms, emphasizing methods useful in practice. Topics covered include: sorting; search trees, heaps, and hashing; divide-and-conquer; dynamic programming; amortized analysis; graph algorithms; shortest paths; network flow; computational geometry; number-theoretic algorithms; polynomial and matrix calculations; caching; and parallel computing. This course was also taught as part of the Singapore-MIT Alliance (SMA) programme as course number SMA 5503 (Analysis and Design of Algorithms).
Chapters
Select a chapter to play
| ocw-6.046-07sep2005-220k (Video) | 1:20:37 | |
| ocw-6.046-12sep2005-220k (Video) | 1:10:33 | |
| ocw-6.046-14sep2005-220k (Video) | 1:08:34 | |
| ocw-6.046-21sep2005-220k (Video) | 1:20:34 | |
| ocw-6.046-26sep2005-220k (Video) | 1:16:51 | |
| ocw-6.046-28sep2005-220k (Video) | 1:08:50 | |
| ocw-6.046-03oct2005-220k (Video) | 1:17:41 | |
| ocw-6.046-05oct2005-220k (Video) | 1:19:48 | |
| ocw-6.046-17oct2005-220k (Video) | 1:21:23 | |
| ocw-6.046-19oct2005-220k (Video) | 1:23:53 | |
| ocw-6.046-24oct2005-220k (Video) | 1:23:46 | |
| ocw-6.046-26oct2005-220k (Video) | 1:25:33 | |
| ocw-6.046-31oct2005-220k (Video) | 1:19:07 | |
| ocw-6.046-02nov2005-220k (Video) | 1:14:29 | |
| ocw-6.046-07nov2005-220k (Video) | 1:11:02 | |
| ocw-6.046-09nov2005-220k (Video) | 1:24:08 | |
| ocw-6.046-14nov2005-220k (Video) | 1:24:35 | |
| ocw-6.046-16nov2005-220k (Video) | 1:17:18 | |
| ocw-6.046-21nov2005-220k (Video) | 1:15:00 | |
| ocw-6.046-05dec2005-220k (Video) | 1:15:09 | |
| ocw-6.046-07dec2005-220k (Video) | 1:16:49 | |
| ocw-6.046-12dec2005-220k (Video) | 1:24:49 | |
| ocw-6.046-14dec2005-220k (Video) | 1:25:22 |