## MIT: Algorithm Lectures Video

Lecture 1: Administrivia; Introduction; Analysis of Algorithms, Insertion Sort, Mergesort- Go to this video

Lecture 2: Asymptotic Notation; Recurrences; Substitution, Master Method- Go to this video

Lecture 3: Divide-and-Conquer: Strassen, Fibonacci, Polynomial Multiplication- Go to this video

Lecture 4: Quicksort, Randomized Algorithms- Go to this video

Lecture 5: Linear-time Sorting: Lower Bounds, Counting Sort, Radix Sort-Go to this video

Lecture 6: Order Statistics, Median- Go to this video

Lecture 7: Hashing, Hash Functions- Go to this video

Lecture 8: Universal Hashing, Perfect Hashing- Go to this video

Lecture 9: Relation of BSTs to Quicksort – Analysis of Random BST- Go to this video

Lecture 10: Red-black Trees, Rotations, Insertions, Deletions- Go to this video