| 
w   b
Course

Introduction to Algorithms

Massachusetts Institute of 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; 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.

Continue Reading ▼
Home > Computer Science > Programming > Introduction to Algorithms Lectures: