Description:
This course provides an introduction to algorithms. Topics 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. Selected lecture notes, video and audio lectures, and assignments with solutions are included. MIT presents OpenCourseWare as free educational material online. No registration or enrollment is required to use the materials.

## Resource Comments