Introduction to Algorithms (2005) MIT

 Technology

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; divideandconquer; dynamic programming; amortized analysis; graph algorithms; shortest paths; network flow; computational geometry; numbertheoretic algorithms; polynomial and matrix calculations; caching; and parallel computing.
Customer Reviews
Top Podcasts In Technology
Listeners Also Subscribed To
More by MIT
Introduction to Computer Science and Programming
Eric Grimson, John Guttag
Introduction to Psychology
Prof. Jeremy Wolfe
Linear Algebra
Prof. Gilbert Strang
Circuits and Electronics
Instructor: Prof. Anant Agarwal
Single Variable Calculus
Prof. David Jerison
Artificial Intelligence
Patrick Winston, Mark Seifter