
23 episodes

Introduction to Algorithms (2005) MIT
-
- Technology
-
-
4.7 • 3 Ratings
-
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.
-
- video
Lecture 01: Administrivia/Introduction/Analysis of Algorithms, Insertion Sort, Mergesort
-
- video
Lecture 02: Asymptotic Notation/Recurrences/Substitution, Master Method
-
- video
Lecture 03: Divide-and-Conquer: Strassen, Fibonacci, Polynomial Multiplication
-
-
- video
Lecture 05: Linear-time Sorting: Lower Bounds, Counting Sort, Radix Sort
-
Customer Reviews
Top Podcasts In Technology
Listeners Also Subscribed To






More by MIT





