| Topic | Author |
| Assignment: Questions/Thoughts? | Ashish Gupta (13) |
| Advanced Topics (cont.) - Discussion of Follow-on Classes: Questions/Thoughts? | Ashish Gupta (13) |
| Advanced Topics (cont.): Questions/Thoughts? | Ashish Gupta (13) |
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).
Instructor: Erik Demaine
Source: MIT OpenCourseWare
License: Creative Commons BY-NC-SA
Donations: Donate to MIT
NIXTY is not affiliated or endorsed by Massachusetts Institute of Technology. Please consider donating to MIT by clicking on the link immediately above.
