Introduction to Algorithms (SMA 5503), Fall 2004
(Complete Item Description)
- Abstract:
Techniques for the design and analysis of efficient algorithms, emphasizing methods useful in practice. Topics: 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.
- Subject:
- Science and Technology
- Grade Level:
- Post-secondary
- Collection:
- MIT OpenCourseWare
