Introduction to Algorithms by Prof. Erik Demaine & Prof. Charles Leiserson

To listen to an audio podcast, mouse over the title and click Play. Open iTunes to download and subscribe to iTunes U collections.

Description

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.

	Name	Description	Released	Price
1	VideoLecture 01: Administrivia/Introduction/Analysis of Algorithms, Insertion Sort, Mergesort	--	1/6/09	Free	View In iTunes
2	VideoLecture 02: Asymptotic Notation/Recurrences/Substitution, Master Method	--	1/6/09	Free	View In iTunes
3	VideoLecture 03: Divide-and-Conquer: Strassen, Fibonacci, Polynomial Multiplication	--	1/6/09	Free	View In iTunes
4	VideoLecture 04: Quicksort, Randomized Algorithms	--	1/6/09	Free	View In iTunes
5	VideoLecture 05: Linear-time Sorting: Lower Bounds, Counting Sort, Radix Sort	--	1/6/09	Free	View In iTunes
6	VideoLecture 06: Order Statistics, Median	--	1/6/09	Free	View In iTunes
7	VideoLecture 07: Hashing, Hash Functions	--	1/6/09	Free	View In iTunes
8	VideoLecture 08: Universal Hashing, Perfect Hashing	--	1/6/09	Free	View In iTunes
9	VideoLecture 09: Relation of BSTs to Quicksort/Analysis of Random BST	--	1/6/09	Free	View In iTunes
10	VideoLecture 10: Red-black Trees, Rotations, Insertions, Deletions	--	1/6/09	Free	View In iTunes
11	VideoLecture 11: Augmenting Data Structures, Dynamic Order Statistics, Interval Trees	--	1/6/09	Free	View In iTunes
12	VideoLecture 12: Skip Lists	--	1/6/09	Free	View In iTunes
13	VideoLecture 13: Amortized Algorithms, Table Doubling, Potential Method	--	1/6/09	Free	View In iTunes
14	VideoLecture 14: Competitive Analysis: Self-organizing Lists	--	1/6/09	Free	View In iTunes
15	VideoLecture 15: Dynamic Programming, Longest Common Subsequence	--	1/6/09	Free	View In iTunes
16	VideoLecture 16: Greedy Algorithms, Minimum Spanning Trees	--	1/6/09	Free	View In iTunes
17	VideoLecture 17: Shortest Paths I: Properties, Dijkstra's Algorithm, Breadth-first Search	--	1/6/09	Free	View In iTunes
18	VideoLecture 18: Shortest Paths II: Bellman-Ford, Linear Programming, Difference Constraints	--	1/6/09	Free	View In iTunes
19	VideoLecture 19: Shortest Paths III: All-pairs Shortest Paths, Matrix Multiplication, Floyd-Warshall, Johnson	--	1/6/09	Free	View In iTunes
20	VideoLecture 22: Advanced Topics	--	1/6/09	Free	View In iTunes
21	VideoLecture 23: Advanced Topics (cont.)	--	1/6/09	Free	View In iTunes
22	VideoLecture 24: Advanced Topics (cont.)	--	1/6/09	Free	View In iTunes
23	VideoLecture 25: Advanced Topics (cont.)/Discussion of Follow-on Classes	--	1/6/09	Free	View In iTunes

Total: 23 Episodes