17. Complexity: Approximation Algorithms
1:17:43
18. Complexity: Fixed-Parameter Algorithms
1:25:25
16. Complexity: P, NP, NP-completeness, Reductions
25:55
12.0 - Approximation Algorithms
1:22:58
13. Incremental Improvement: Max Flow, Min Cut
1:22:01
21. Cryptography: Hash Functions
1:23:35
1. Course Overview, Interval Scheduling
1:20:15
4. Divide & Conquer: van Emde Boas Trees
31:53