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
Lafikea
,
Good lecture
Well explained, very good for novice as well as advanced programmer. Lectures are clear and to the point, humorous too :)
Harshitt
,
Thanks
Really very helpfull,thanks mit
Top Podcasts In Technology
Listeners Also Subscribed To
Introduction to Algorithms (2011)
Erik Demaine, Srini Devadas
Advanced Data Structures
Erik Demaine
Design and Analysis of Algorithms (2015)
Erik Demaine, Srinivas Devadas, Nancy Ann Lynch
Mathematics for Computer Science (2010)
Tom Leighton, Marten van Dijk
Mathematics for Computer Science (2015)
Albert R. Meyer
Computer System Engineering
Prof. Hari Balakrishnan, Prof. Samuel Madden
More by MIT
Artificial Intelligence
Patrick Winston, Mark Seifter
Introduction to Psychology
Prof. Jeremy Wolfe
Introduction to Algorithms (2011)
Erik Demaine, Srini Devadas
Circuits and Electronics
Instructor: Prof. Anant Agarwal
Linear Algebra
Prof. Gilbert Strang
Introduction to Computer Science and Programming
Eric Grimson, John Guttag