Free Stuff in These Categories
Find More Titles by
|
Introduction to Algorithms
MIT Course 6.046J-18.410J |
|
|
|
Video
Title Details
Running Time
30 Hrs. 5 Min.
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. This course was also taught as part of the Singapore-MIT Alliance (SMA) programme as course number SMA 5503 (Analysis and Design of Algorithms).
People Who Liked Introduction to Algorithms Also Liked These Free Titles: