23 episodes

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.

Introduction to Algorithms (2005) MIT

    • Technology
    • 4.6, 27 Ratings

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.

Customer Reviews

4.6 out of 5
27 Ratings

27 Ratings

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

More by MIT