Sign up

Introduction to Algorithms (2005)

Podcast
0
Ratings0
Reviews0
Followers0
Q's
Introduction to Algorithms (2005)
Introduction to Algorithms (2005)
Highlights
Introduction to Algorithms (2005)

Technology

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.

Related Items:
No related items currently exists - add one now
Publisher Prof. Erik Demaine Prof. Charles Leiserson
Website http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-046j-introduction-to-algorithms-sma-5503-fall-2005/
Language(s) English

Images And Data Courtesy Of: Prof. Erik Demaine Prof. Charles Leiserson.
This content (including text, images, videos and other media) is published and used in accordance with Fair Use.

Added By
Edit this item to be credited with its creation