Lecture 1
Play Video |
Administrivia - Introduction - Analysis of Algorithms, Insertion Sort, Mergesort
|
Lecture 2
Play Video |
Asymptotic Notation - Recurrences - Substitution, Master Method
|
Lecture 3
Play Video |
Divide-and-Conquer: Strassen, Fibonacci, Polynomial Multiplication
|
Lecture 4
Play Video |
Quicksort, Randomized Algorithms
|
Lecture 5
Play Video |
Linear-time Sorting: Lower Bounds, Counting Sort, Radix Sort
|
Lecture 6
Play Video |
Order Statistics, Median
|
Lecture 7
Play Video |
Hashing, Hash Functions
|
Lecture 8
Play Video |
Universal Hashing, Perfect Hashing
|
Lecture 9
Play Video |
Relation of BSTs to Quicksort - Analysis of Random BST
|
Lecture 10
Play Video |
Red-black Trees, Rotations, Insertions, Deletions
|
Lecture 11
Play Video |
Augmenting Data Structures, Dynamic Order Statistics, Interval Trees
|
Lecture 12
Play Video |
Skip Lists
|
Lecture 13
Play Video |
Amortized Algorithms, Table Doubling, Potential Method
|
Lecture 14
Play Video |
Competitive Analysis: Self-organizing Lists
|
Lecture 15
Play Video |
Dynamic Programming, Longest Common Subsequence
|
Lecture 16
Play Video |
Greedy Algorithms, Minimum Spanning Trees
|
Lecture 17
Play Video |
Shortest Paths I: Properties, Dijkstra's Algorithm, Breadth-first Search
|
Lecture 18
Play Video |
Shortest Paths II: Bellman-Ford, Linear Programming, Difference Constraints
|
Lecture 19
Play Video |
Shortest Paths III: All-pairs Shortest Paths, Matrix Multiplication, Floyd-Warshall, Johnson
|
Lecture 22
Play Video |
Advanced Topics
|
Lecture 23
Play Video |
Advanced Topics (cont.)
|
Lecture 24
Play Video |
Advanced Topics (cont.)
|
Lecture 25
Play Video |
Advanced Topics (cont.) - Discussion of Follow-on Classes
|
Searching...
