## 6.046J Introduction to Algorithms (SMA 5503) (MIT)

6.046J Introduction to Algorithms (SMA 5503) (MIT) 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. 6.046J Introduction to Algorithms (SMA 5503) (MIT) course was also taught as part of the Singapore-MIT Alliance (SMA) programme as course number SMA 5503 (Analysis and Design of Algorithms).

- Source: Massachusetts Institute of Technology
- Language: English
- Author: Leiserson, Charles
- Lisence Terms: Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see http://ocw.mit.edu/terms/index.htm
- Tags: algorithms, efficient algorithms, sorting, search trees, heaps, hashing, divide-and-conquer, dynamic programming, amortized analysis, graph algorithms, shortest paths, network flow, computational geometry, number-theoretic algorithms, polynomial and matrix calculations, caching, parallel computing,
- Course Publishing Date: Apr 24, 2006

##