Lecture 1 - Introduction and Review
Lecture 2 - Recurrences
Lecture 3 - Heapsort and Quicksort
Lecture 4 - Linear Sorts
Lecture 5 - Hash Tables
Lecture 6 - Binary and Red-Black Trees
Lecture 7 - Augmented Data Structures
Lecture 8 - Dynamic Programming
Lecture 9 - Greedy Algorithms
Lecture 10 - Amortized Analysis
Lecture 11 - B-Trees
Lecture 13 - Mergeable Heaps
Lecture 15 - Disjoint Sets
Lecture 16 - Graph Algorithms
Lecture 17 - Minimum Spanning Trees
Lecture 18 - Shortest Paths
Lecture 19 - Maximum Flow
Lecture 20 - Parallel Algorithms
Lecture 23 - Encryption
Lecture 24 - Boyer-Moore Algorithm
Lecture 25 - Computational Geometry
Lecture 26 - NP-Completeness
Lecture 27 - NP-Completeness
Lecture 28 - Approximation Algorithms