Introduction to Algorithms
by MIT
This course material is only available in the iTunes U app on iPhone or iPad.
Course 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.
The textbook for this course is: Cormen, Thomas H., Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. Introduction to Algorithms. 2nd ed. Cambridge, MA: MIT Press. ISBN: 0262032937.
This content is provided under a Creative Commons Attribution-NonCommercial-ShareAlike 3.0 license.
| Name | Description | Time | Price | ||
|---|---|---|---|---|---|
| 1 | Lecture Notes 1: Analysis of Algorithms | -- | -- | Free | View in iTunes |
| 2 | Lecture Notes 2: Asymptotic Notation and Recurrences | -- | -- | Free | View in iTunes |
| 3 | Lecture Notes 3: Divide and Conquer | -- | -- | Free | View in iTunes |
| 4 | Lecture Notes 4: Quicksort | -- | -- | Free | View in iTunes |
| 5 | Lecture Notes 5: Linear-time Sorting: Lower Bounds, Counting Sort, Radix Sort | -- | -- | Free | View in iTunes |
| 6 | Lecture Notes 6: Order Statistics, Median | -- | -- | Free | View in iTunes |
| 7 | Lecture Notes 7: Hashing, Hash Functions | -- | -- | Free | View in iTunes |
| 8 | Lecture Notes 8: Universal Hashing, Perfect Hashing | -- | -- | Free | View in iTunes |
| 9 | Lecture Notes 9: Relation of BSTs to Quicksort - Analysis of Random BST | -- | -- | Free | View in iTunes |
| 10 | Lecture Notes 10: Red-black Trees, Rotations, Insertions, Deletions | -- | -- | Free | View in iTunes |
| 11 | Lecture Notes 11: Augmenting Data Structures, Dynamic Order Statistics, Interval Trees | -- | -- | Free | View in iTunes |
| 12 | Lecture Notes 12: Skip Lists | -- | -- | Free | View in iTunes |
| 13 | Lecture Notes 13: Amortized Algorithms, Table Doubling, Potential Method | -- | -- | Free | View in iTunes |
| 14 | Lecture Notes 14: Competitive Analysis: Self-organizing Lists | -- | -- | Free | View in iTunes |
| 15 | Lecture Notes 15: Dynamic Programming, Longest Common Subsequence | -- | -- | Free | View in iTunes |
| 16 | Lecture Notes 16: Greedy Algorithms, Minimum Spanning Trees | -- | -- | Free | View in iTunes |
| 17 | Lecture Notes 17: Shortest Paths I: Properties, Dijkstra's Algorithm, Breadth-first Search | -- | -- | Free | View in iTunes |
| 18 | Lecture Notes 18: Shortest Paths II: Bellman-Ford, Linear Programming, Difference Constraints | -- | -- | Free | View in iTunes |
| 19 | Lecture Notes 19: Shortest Paths III: All-pairs Shortest Paths, Matrix Multiplication, Floyd-Warshall, Johnson | -- | -- | Free | View in iTunes |
| 20 | Lecture Notes: Skip Lists | -- | -- | Free | View in iTunes |
| 21 | Problem Set 1 | -- | -- | Free | View in iTunes |
| 22 | Problem Set 1 Solutions | -- | -- | Free | View in iTunes |
| 23 | Problem Set 2 | -- | -- | Free | View in iTunes |
| 24 | Problem Set 2 Solutions | -- | -- | Free | View in iTunes |
| 25 | Problem Set 3 | -- | -- | Free | View in iTunes |
| 26 | Problem Set 3 Solutions | -- | -- | Free | View in iTunes |
| 27 | Problem Set 4 | -- | -- | Free | View in iTunes |
| 28 | Problem Set 4 Solutions | -- | -- | Free | View in iTunes |
| 29 | Problem Set 5 | -- | -- | Free | View in iTunes |
| 30 | Problem Set 5 Solutions | -- | -- | Free | View in iTunes |
| 31 | Problem Set 6 | -- | -- | Free | View in iTunes |
| 32 | Problem Set 6 Solutions | -- | -- | Free | View in iTunes |
| 33 | Problem Set 7 | -- | -- | Free | View in iTunes |
| 34 | Problem Set 7 Solutions | -- | -- | Free | View in iTunes |
| 35 | Problem Set 7: sample | -- | -- | Free | View in iTunes |
| 36 | Problem Set 7: samplesol | -- | -- | Free | View in iTunes |
| 37 | Problem Set 7: input1 | -- | -- | Free | View in iTunes |
| 38 | Problem Set 7: input2 | -- | -- | Free | View in iTunes |
| 39 | Problem Set 7: input3 | -- | -- | Free | View in iTunes |
| 40 | Problem Set 8 | -- | -- | Free | View in iTunes |
| 41 | Problem Set 8 Solutions | -- | -- | Free | View in iTunes |
| 42 | Problem Set 9 | -- | -- | Free | View in iTunes |
| 43 | Problem Set 9 Solutions | -- | -- | Free | View in iTunes |
| 44 | Practice Quiz 1 | -- | -- | Free | View in iTunes |
| 45 | Practice Quiz 1 Solutions | -- | -- | Free | View in iTunes |
| 46 | Quiz 1 | -- | -- | Free | View in iTunes |
| 47 | Quiz 1 Solutions | -- | -- | Free | View in iTunes |
| 48 | Quiz 2 Practice | -- | -- | Free | View in iTunes |
| 49 | Quiz 2 | -- | -- | Free | View in iTunes |
| 50 | Quiz 2 Solutions | -- | -- | Free | View in iTunes |
| 51 | Practice Final | -- | -- | Free | View in iTunes |
| 52 | Practice Final Exam Solutions | -- | -- | Free | View in iTunes |
| 53 | Final Exam | -- | -- | Free | View in iTunes |
| 54 | Final Exam Solutions | -- | -- | Free | View in iTunes |
| 55 | Dynamic Algorithms Handout | -- | -- | Free | View in iTunes |
| 56 | Skip Lists Handout | -- | -- | Free | View in iTunes |
| 56 Items |
Customer Reviews
Awesum
I had this course in my college .But i was not getting anything in college .This course helped me a lot thnku so much Apple
Huge help
These course videos are the only reason I'm doing so well in my algorithms class this semester!
Bad video quality
I usually treat these video like actual course, so I take note and do exercises after finishing a lecture. However, due to the extremely low quality of the video it's quite difficult take some good notes. I need to enlarge and shrink the screen to see what the professor wrote. Also I only enjoyed the sorting algorithms but not too concern about the derivation (since that's all i need to digest in order to implement certain methods in my code anyway). The derivation part is just way too tedious. In fact sometime I wasn't sure if the professor knows what he's talking about.
