Charles Leiserson

Lecture 01: Administrivia/Introduction/Analysis of Algorithms, Insertion Sort, Mergesort

Lecture 02: Asymptotic Notation/Recurrences/Substitution, Master Method

Lecture 03: Divide-and-Conquer: Strassen, Fibonacci, Polynomial Multiplication

Lecture 05: Linear-time Sorting: Lower Bounds, Counting Sort, Radix Sort

Lecture 04: Quicksort, Randomized Algorithms

Lecture 07: Hashing, Hash Functions

Lecture 15: Dynamic Programming, Longest Common Subsequence

Lecture 06: Order Statistics, Median

Lecture 16: Greedy Algorithms, Minimum Spanning Trees

Lecture 12: Skip lists