Introduction to Algorithms (MIT)

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.

(Click below link to follow Course Videos)
·         Video lectures: 6.064J/18.410J (MIT)
·         Course homepage

No comments:

Post a Comment