Free Intro to Algorithms video lectures from MIT

April 16, 2009

Course Description

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.

http://academicearth.org/courses/introduction-to-algorithms

Posted by | Filed Under Programming, Lectures, Algorithms 

Comments

Got something to say?

You must be logged in to post a comment.