4. Divide & Conquer: van Emde Boas Trees
1:15:53
5. Amortization: Amortized Analysis
1:25:25
16. Complexity: P, NP, NP-completeness, Reductions
13:20
K-d Trees - Computerphile
1:20:52
3. Divide & Conquer: FFT
1:09:58
MIT Introduction to Deep Learning | 6.S191
1:22:58
13. Incremental Improvement: Max Flow, Min Cut
1:23:35
1. Course Overview, Interval Scheduling
50:59