Sorting Lower Bounds and Linear-Time Sorting
By Erik Demaine - MIT
-
1,401
- Report An Inaccuracy In Lecture Information:
Lecture Description
Course 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.
Course Index
Show:
