Introduction to Algorithms

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).

Lectures:

Lecture 4 (01:20:33)
Lecture 6 (01:08:49)
Lecture 7 (01:17:40)
Lecture 12 (01:25:32)
Lecture 20 (01:15:08)
Lecture 21 (01:16:48)
Lecture 22 (01:24:48)

Citation

Leiserson, Charles, and Erik Demaine. 6.046J Introduction to Algorithms (SMA 5503), Fall 2005. (Massachusetts Institute of Technology: MIT OpenCourseWare), http://ocw.mit.edu

Instructors

Prof. Charles Leiserson
Prof. Erik Demaine

Additional Notes

schooX is not affiliated or endorsed by Massachusetts Institute of Technology. Please consider donating to MIT by clicking on the donation button below.

License

Donate