01:30:47duration 1 hour 30 minutes
Part6-1 (Approximation Algorithms)
Uppladdad av Marc Hellmuth
01:17:28duration 1 hour 17 minutes
Part6-2 (Approximation Algorithms)
01:14:38duration 1 hour 14 minutes
Part5-2 (Greedy Algorithms and Matroids)
01:22:29duration 1 hour 22 minutes
Part5-1 (Greedy Algorithms and Matroids)
01:24:19duration 1 hour 24 minutes
Part4 (Dynamic Programming)
01:50:18duration 1 hour 50 minutes
Part3 (Shortest Path Problems)
01:03:50duration 1 hour 3 minutes
CrashCourseRuntime
01:27:47duration 1 hour 27 minutes
Part2-2 (Computational Complexity)
01:39:39duration 1 hour 39 minutes
Part2-1 (Computational Complexity)
01:30:03duration 1 hour 30 minutes
Part1 (TM, some GT)
01:54:20duration 1 hour 54 minutes
Part7 (DS balanced (AVL) trees)
01:19:05duration 1 hour 19 minutes
Part10 (Selected Topic: Euklid, Golden Ratio,…
Part10 (Selected Topic: Euklid, Golden Ratio, Fibonacci Numbers)
58:54duration 58 minutes 54 seconds
Part9 (DS Hash Tables and Bloom Filters)
01:51:53duration 1 hour 51 minutes
Part8 (Suffix Trees)