Material Detail
6.046J / 18.410J Introduction to Algorithms (SMA 5503)
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).
Quality
- User Rating
- Comments
- Learning Exercises
- Bookmark Collections
- Course ePortfolios
- Accessibility Info
More about this material
- Material Type:
- Online Course
- Date Added to MERLOT:
- August 10, 2012
- Date Modified in MERLOT:
- June 12, 2018
- Authors:
-
Prof. Charles Leiserson
Prof. Erik Demaine - Submitter:
-
Barbra Bied Sperling
- Primary Audience:
- College General Ed, College Lower Division
- Mobile Compatibility:
- Not specified at this time
- Language:
- English
- Cost Involved:
- No
- Source Code Available:
- Unknown
- Creative Commons:
-
This work is licensed under a Attribution-NonCommercial-ShareAlike 3.0 United States
