To kachingle this site, install the KachingleX Browser Extension.

MIT OCW - Introduction to Algorithms


About

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.

First kachingled on:
Jun 10, 2011

Photo Credit:
DESCRIPTION FROM: Course Introduction page at http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-046j-introduction-to-algorithms-sma-5503-fall-2005

LOGO IMAGE: Creative Commons license – Flickr Photo entitled "Test Many Circles" by jared |
Jared Tarbell at url - http://www.flickr.com/photos/generated/942345473/

* Site is paid by check

Medallion


Support MIT OCW - Introduction to Algorithms now!

Support MIT OCW - Introduction to Algorithms with Kachingle, a one-click way to support your favorite digital stuff! Be a part of the movement for open and free information for all, supported by people who care, people like you!

Sign up now!
avatar

1 visit, last Aug 24, 2011
1 payment totalling $0.01
Kachingler since Nov 28, 2009