Introduction to Algorithms (SMA 5503), MIT OpenCourseWare (OCW)

/Home/g. Open Source Courses/Computer Science Undergraduate Courses

Massachusetts Institute of Technology,
77 Massachusetts Avenue,
Cambridge, MA 02139-4307,

This course features a complete set of lecture notes and videos. The course textbook was co-written by Prof. Leiserson.

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.