Now showing
MIT 6.046J / 18.410J Introduction to Algorithms (SMA 5503), Fall 2005 (2005); Real Media files
About this film
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).
Directors & creators
MIT OpenCourseWare
Subjects
algorithms, efficient algorithms, sorting, search trees, heaps, hashing, divide-and-conquer, dynamic programming, amortized analysis, graph algorithms, shortest paths, network flow, computational geometry, number-theoretic algorithms, polynomial and matrix calculations, caching, parallel computing
More from this pool