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