MIT 6.046J Introduction to Algorithms
MIT OpenCourseWare
EducationScience
Clips are not offered for this film: a Creative Commons licence on a work dated before such licences existed.
Parts
About
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.
- Archive
- Internet Archive, in MIT OpenCourseWare
- Licence or status
- CC BY-NC-SA 3.0, as the Internet Archive states it.
- Credit
- MIT OpenCourseWare
- Who can watch
- The archive gives no rating. Invisible Network shows it to Tweens profiles and older, judged from its collection and subjects. How films are placed