Coursera- Algorithm Design & Analysis 2

1. 9 - 3 - A Greedy Algorithm (17 min).mp4 25.29 MB
2. 2 - 6 - Graph Search - Overview [Part I Review - Optional] (23 min).mp4 24.94 MB
3. 8 - 7 - The Ackermann Function [Advanced - Optional](17 min).mp4 23.18 MB
4. 20 - 1 - Stable Matching [Optional] (15 min).mp4 23.09 MB
5. 8 - 3 - Analysis of Union-by-Rank [Advanced - Optional](15).mp4 22.82 MB
6. 2 - 7 - Dijkstra_'s Shortest-Path Algorithm [Part I Review - Optional] (21 min).mp4 22.45 MB
7. 19 - 7 - Analysis of Papadimitriou_'s Algorithm (15 min).mp4 22.14 MB
8. 8 - 4 - Path Compression [Advanced - Optional] (15).mp4 22.02 MB
9. 19 - 6 - Random Walks on a Line (16 min).mp4 21.84 MB
10. 17 - 4 - The Traveling Salesman Problem (15 min).mp4 21.50 MB
11. 20 - 2 - Matchings, Flows, and Braess_'s Paradox [Optional] (14 min).mp4 21.47 MB
12. 8 - 8 - Path Compression_ Tarjan_'s Analysis I [Advanced - Optional].mp4 21.28 MB
13. 16 - 1 - Polynomial-Time Solvable Problems (14 min).mp4 20.98 MB
14. 2 - 2 - Why Study Algorithms_ [Part I Review - Optional] (19 min).mp4 20.73 MB
15. 16 - 2 - Reductions and Completeness (14 min).mp4 20.34 MB
16. 16 - 6 - Algorithmic Approaches to NP-Complete Problems (13 min).mp4 20.33 MB
17. 5 - 6 - Fast Implementation I (15 min).mp4 20.13 MB
18. 19 - 5 - The 2-SAT Problem (15 min).mp4 20.11 MB
19. 15 - 4 - A Reweighting Technique (14 min).mp4 20.09 MB
20. 12 - 1 - Optimal Substructure (14 min).mp4 20.00 MB
21. 2 - 9 - Heaps_ Operations and Applications [Part I Review - Optional] (18).mp4 19.96 MB
22. 8 - 9 - Path Compression_ Tarjan_'s Analysis II [Advanced - Optional].mp4 19.55 MB
23. 5 - 3 - Correctness Proof I (16 min).mp4 19.47 MB
24. 15 - 3 - The Floyd-Warshall Algorithm (13 min).mp4 19.34 MB
25. 6 - 4 - Implementing Kruskal_'s Algorithm via Union-Find II (14 min).mp4 19.33 MB
26. 2 - 3 - Guiding Principles for Analysis of Algorithms [Part I Review - Optional] (15 min).mp4 19.31 MB
27. 18 - 1 - A Greedy Knapsack Heuristic (14 min).mp4 19.19 MB
28. 18 - 6 - Ananysis of Dynamic Programming Heuristic (15 min).mp4 19.15 MB
29. 14 - 6 - A Space Optimization (12 min).mp4 18.78 MB
30. 2 - 1 - About the Course [Part I Review - Optional] (17 min).mp4 18.77 MB
31. 8 - 2 - Union-by-Rank [Advanced - Optional] (12 min).mp4 18.63 MB
32. 3 - 1 - Introduction to Greedy Algorithms (13 min).mp4 18.47 MB
33. 17 - 5 - A Dynamic Programming Algorithm for TSP (12 min).mp4 17.87 MB
34. 13 - 1 - Problem Definition (12 min).mp4 17.60 MB
35. 8 - 6 - Path Compression_ The Hopcroft-Ullman Analysis II [Advanced - Optional].mp4 17.58 MB
36. 4 - 2 - A Greedy Algorithm (13 min).mp4 17.57 MB
37. 15 - 6 - Johnson_'s Algorithm II (11 min).mp4 17.26 MB
38. 20 - 3 - Linear Programming and Beyond [Optional] (11 min).mp4 17.24 MB
39. 9 - 6 - Correctness Proof II (13 min).mp4 17.15 MB
40. 14 - 7 - Internet Routing I [Optional] (11 min).mp4 17.12 MB
41. 12 - 2 - A Dynamic Programming Algorithm (12 min).mp4 17.11 MB
42. 15 - 2 - Optimal Substructure (12 min).mp4 16.93 MB
43. 16 - 3 - Definition and Interpretation of NP-Completeness I (11 min).mp4 16.74 MB
44. 15 - 5 - Johnson_'s Algorithm I (11 min).mp4 15.86 MB
45. 18 - 4 - A Dynamic Programming Heuristic for Knapsack (12 min).mp4 15.78 MB
46. 9 - 2 - Problem Definition (10 min).mp4 15.72 MB
47. 14 - 2 - Optimal Substructure (11 min).mp4 15.63 MB
48. 8 - 1 - Lazy Unions [Advanced - Optional] (10 min).mp4 15.61 MB
49. 14 - 1 - Single-Source Shortest Paths, Revisted (11 min).mp4 15.51 MB
50. 7 - 1 - Application to Clustering (12 min).mp4 15.49 MB