| 1. Lecture 01: Administrivia/Introduction/Analysis of Algorithms, Insertion Sort, Mergesort | not rated | 1:21:14 |
| 2. Lecture 03: Divide-and-Conquer: Strassen, Fibonacci, Polynomial Multiplication | not rated | 1:09:08 |
| 3. Lecture 04: Quicksort, Randomized Algorithms | not rated | 1:21:12 |
| 4. Lecture 05: Linear-time Sorting: Lower Bounds, Counting Sort, Radix Sort | not rated | 1:17:27 |
| 5. Lecture 06: Order Statistics, Median | not rated | 1:09:25 |
| 6. Lecture 07: Hashing, Hash Functions | not rated | 1:18:44 |
| 7. Lecture 08: Universal Hashing, Perfect Hashing | not rated | 1:12:41 |
| 8:49:51 |
Social info