MIT Introduction to Algorithms Lectures [3.24 GiB]
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.
This course was also taught as part of the Singapore-MIT Alliance (SMA) programme as course number SMA 5503 (Analysis and Design of Algorithms).
Important:
Please say Thank You if you like my post !
Search my posts to find more quality and interesting Stuff !
If you want to have high speed and parallel downloads buy premium account!
To Unzip the files please use 7zip and WinRar. Thanks
Code:
Archive Password: 1984
Links:
Code:
http://uploaded.net/file/neugn5z8/MIT.Introduction.to.Algorithms.Lectures.rar
03-01-2013, 10:29 AM
MIT Introduction to Algorithms Lectures
Linear Mode
