04:24duration 4 minutes 24 seconds
Quick sort in 4 minutes
Step by step instructions showing how to run…
02:46duration 2 minutes 46 seconds
Final Thoughts
34:56duration 34 minutes 56 seconds
Lecture 38- Complexity_ Fixed-Parameter Algorithms
40:51duration 40 minutes 51 seconds
Lecture 37- Complexity_ Approximation Algorithms
46:27duration 46 minutes 27 seconds
Lecture 36- Complexity_ P, NP, NP-completeness,…
Lecture 36- Complexity_ P, NP, NP-completeness, Reductions
32:46duration 32 minutes 46 seconds
Lecture 35- Linear Programming_ LP, reductions,…
Lecture 35- Linear Programming_ LP, reductions, Simplex
35:39duration 35 minutes 39 seconds
Lecture 34- Incremental Improvement- Matching
41:17duration 41 minutes 17 seconds
Lecture 33- Incremental Improvement- Max Flow,…
Lecture 33- Incremental Improvement- Max Flow, Min Cut
35:43duration 35 minutes 43 seconds
Lecture 32- Greedy Algorithms_ Minimum Spanning…
Lecture 32- Greedy Algorithms_ Minimum Spanning Tree
41:39duration 41 minutes 39 seconds
Lecture 31- Dynamic Programming_ All-Pairs…
Lecture 31- Dynamic Programming_ All-Pairs Shortest Paths
27:20duration 27 minutes 20 seconds
Lecture 30- Dynamic Programming_ Advanced DP
46:44duration 46 minutes 44 seconds
Lecture 27- Randomization- Skip Lists
36:19duration 36 minutes 19 seconds
Lecture 29- Augmentation_ Range Trees
42:41duration 42 minutes 41 seconds
Lecture 28- Randomization_ Universal &…
Lecture 28- Randomization_ Universal & Perfect Hashing
51:13duration 51 minutes 13 seconds
Lecture 26_ Randomization_ Matrix Multiply,…
Lecture 26_ Randomization_ Matrix Multiply, Quicksort
32:15duration 32 minutes 15 seconds
Lecture 25- Amortization_ Amortized Analysis
41:11duration 41 minutes 11 seconds
Lecture 24- Divide & Conquer_ van Emde Boas…
Lecture 24- Divide & Conquer_ van Emde Boas Trees
53:29duration 53 minutes 29 seconds
Lecture 23- Divide & Conquer_ FFT
53:01duration 53 minutes 1 second
Lecture 22- Divide & Conquer, Convex Hull,…
Lecture 22- Divide & Conquer, Convex Hull, Median Finding
45:37duration 45 minutes 37 seconds
Lecture 21- Overview, Interval Scheduling
36:50duration 36 minutes 50 seconds
Lecture 20- Mid-Course Review.mp4
42:40duration 42 minutes 40 seconds
Lecture 19- Complexity
49:17duration 49 minutes 17 seconds
Lecture 18- Dynamic Programming, Part 4_ Rods,…
Lecture 18- Dynamic Programming, Part 4_ Rods, Subset Sum, Pseudopolynomial
50:24duration 50 minutes 24 seconds
Lecture 17 - Dynamic Programming Pt 3- APSP,…
Lecture 17 - Dynamic Programming Pt 3- APSP, Parens, Piano
44:25duration 44 minutes 25 seconds
Lecture 16- Dynamic Programming, Part 2_ LCS,…
Lecture 16- Dynamic Programming, Part 2_ LCS, LIS, Coins
47:17duration 47 minutes 17 seconds
Lecture 15- Dynamic Programming, Part 1- SRTBOT,…
Lecture 15- Dynamic Programming, Part 1- SRTBOT, Fib, DAGs, Bowling
33:40duration 33 minutes 40 seconds
Lecture 14 -APSP and Johnson
39:50duration 39 minutes 50 seconds
Lecture 13 - Dijkstra's Algorithm
37:16duration 37 minutes 16 seconds
Lecture 12 - Bellman- Ford
40:35duration 40 minutes 35 seconds
Lecture 11 - Weighted Shortest Paths