589689.xyz

Algo2-Stanford

  • 收录时间:2018-06-15 05:55:09
  • 文件大小:2GB
  • 下载次数:21
  • 最近下载:2020-12-01 01:45:37
  • 磁力链接:
立即下载 复制链接

文件列表

  1. 9 - 3 - A Greedy Algorithm (17 min).mp4 25MB
  2. 2 - 6 - Graph Search - Overview [Part I Review - Optional] (23 min).mp4 24MB
  3. 11 - 3 - Example [Review - Optional] (14 min).mp4 24MB
  4. 8 - 7 - The Ackermann Function [Advanced - Optional] (17 min).mp4 23MB
  5. 20 - 1 - Stable Matching [Optional] (15 min).mp4 23MB
  6. 8 - 3 - Analysis of Union-by-Rank [Advanced - Optional] (15 min).mp4 22MB
  7. 2 - 7 - Dijkstra-'s Shortest-Path Algorithm [Part I Review - Optional] (21 min).mp4 22MB
  8. 19 - 7 - Analysis of Papadimitriou-'s Algorithm (15 min).mp4 22MB
  9. 8 - 4 - Path Compression [Advanced - Optional] (15 min).mp4 22MB
  10. 19 - 6 - Random Walks on a Line (16 min).mp4 21MB
  11. 17 - 4 - The Traveling Salesman Problem (15 min).mp4 21MB
  12. 20 - 2 - Matchings, Flows, and Braess-'s Paradox [Optional] (14 min).mp4 21MB
  13. 8 - 8 - Path Compression- Tarjan-'s Analysis I [Advanced - Optional] (14 min).mp4 21MB
  14. 16 - 1 - Polynomial-Time Solvable Problems (14 min).mp4 20MB
  15. 2 - 2 - Why Study Algorithms- [Part I Review - Optional] (19 min).mp4 20MB
  16. 16 - 2 - Reductions and Completeness (14 min).mp4 20MB
  17. 16 - 6 - Algorithmic Approaches to NP-Complete Problems (13 min).mp4 20MB
  18. 5 - 6 - Fast Implementation I (15 min).mp4 20MB
  19. 19 - 5 - The 2-SAT Problem (15 min).mp4 20MB
  20. 15 - 4 - A Reweighting Technique (14 min).mp4 20MB
  21. 12 - 1 - Optimal Substructure (14 min).mp4 20MB
  22. 2 - 9 - Heaps- Operations and Applications [Part I Review - Optional] (18 min).mp4 19MB
  23. 8 - 9 - Path Compression- Tarjan-'s Analysis II [Advanced - Optional] (14 min).mp4 19MB
  24. 5 - 3 - Correctness Proof I (16 min).mp4 19MB
  25. 15 - 3 - The Floyd-Warshall Algorithm (13 min).mp4 19MB
  26. 6 - 4 - Implementing Kruskal-'s Algorithm via Union-Find II (14 min).mp4 19MB
  27. 2 - 3 - Guiding Principles for Analysis of Algorithms [Part I Review - Optional] (15 min).mp4 19MB
  28. 18 - 1 - A Greedy Knapsack Heuristic (14 min).mp4 19MB
  29. 18 - 6 - Ananysis of Dynamic Programming Heuristic (15 min).mp4 19MB
  30. 14 - 6 - A Space Optimization (12 min) (1).mp4 18MB
  31. 14 - 6 - A Space Optimization (12 min).mp4 18MB
  32. 2 - 1 - About the Course [Part I Review - Optional] (17 min).mp4 18MB
  33. 8 - 2 - Union-by-Rank [Advanced - Optional] (12 min).mp4 18MB
  34. 3 - 1 - Introduction to Greedy Algorithms (13 min).mp4 18MB
  35. 17 - 5 - A Dynamic Programming Algorithm for TSP (12 min).mp4 17MB
  36. 13 - 1 - Problem Definition (12 min).mp4 17MB
  37. 8 - 6 - Path Compression- The Hopcroft-Ullman Analysis II [Advanced - Optional] (12 min).mp4 17MB
  38. 4 - 2 - A Greedy Algorithm (13 min).mp4 17MB
  39. 15 - 6 - Johnson-'s Algorithm II (11 min).mp4 17MB
  40. 20 - 3 - Linear Programming and Beyond [Optional] (11 min).mp4 17MB
  41. 9 - 6 - Correctness Proof II (13 min).mp4 17MB
  42. 14 - 7 - Internet Routing I [Optional] (11 min) (1).mp4 17MB
  43. 14 - 7 - Internet Routing I [Optional] (11 min).mp4 17MB
  44. 12 - 2 - A Dynamic Programming Algorithm (12 min).mp4 17MB
  45. 15 - 2 - Optimal Substructure (12 min) (1).mp4 17MB
  46. 15 - 2 - Optimal Substructure (12 min).mp4 17MB
  47. 16 - 3 - Definition and Interpretation of NP-Completeness I (11 min).mp4 16MB
  48. 15 - 5 - Johnson-'s Algorithm I (11 min).mp4 15MB
  49. 18 - 4 - A Dynamic Programming Heuristic for Knapsack (12 min).mp4 15MB
  50. 9 - 2 - Problem Definition (10 min).mp4 15MB
  51. 14 - 2 - Optimal Substructure (11 min) (1).mp4 15MB
  52. 14 - 2 - Optimal Substructure (11 min).mp4 15MB
  53. 8 - 1 - Lazy Unions [Advanced - Optional] (10 min).mp4 15MB
  54. 14 - 1 - Single-Source Shortest Paths, Revisted (11 min) (1).mp4 15MB
  55. 14 - 1 - Single-Source Shortest Paths, Revisted (11 min).mp4 15MB
  56. 7 - 1 - Application to Clustering (12 min).mp4 15MB
  57. 5 - 1 - MST Problem Definition (11 min).mp4 15MB
  58. 3 - 2 - Application- Optimal Caching (11 min).mp4 15MB
  59. 10 - 3 - WIS in Path Graphs- A Linear-Time Algorithm (10 min).mp4 15MB
  60. 19 - 4 - Principles of Local Search II (10 min).mp4 14MB
  61. 2 - 5 - Graph Representations [Part I Review - Optional] (14 min).mp4 14MB
  62. 16 - 5 - The P vs. NP Question (9 min).mp4 14MB
  63. 6 - 5 - MSTs- State-of-the-Art and Open Questions [Advanced - Optional] (9 min).mp4 14MB
  64. 17 - 2 - Smarter Search for Vertex Cover I (10 min).mp4 14MB
  65. 11 - 1 - The Knapsack Problem (10 min).mp4 14MB
  66. 13 - 4 - A Dynamic Programming Algorithm I (10 min) (1).mp4 14MB
  67. 13 - 4 - A Dynamic Programming Algorithm I (10 min).mp4 14MB
  68. 13 - 2 - Optimal Substructure (9 min).mp4 14MB
  69. 1 - 1 - Application- Internet Routing (11 min).mp4 14MB
  70. 8 - 5 - Path Compression- The Hopcroft-Ullman Analysis I [Advanced - Optional] (9 min).mp4 14MB
  71. 11 - 2 - A Dynamic Programming Algorithm (10 min).mp4 14MB
  72. 14 - 4 - The Basic Algorithm II (11 min) (1).mp4 14MB
  73. 14 - 4 - The Basic Algorithm II (11 min).mp4 14MB
  74. 10 - 2 - WIS in Path Graphs- Optimal Substructure (9 min).mp4 14MB
  75. 9 - 5 - Correctness Proof I (10 min).mp4 13MB
  76. 18 - 5 - Knapsack via Dynamic Programming, Revisited (10 min).mp4 13MB
  77. 5 - 7 - Fast Implementation II (10 min).mp4 13MB
  78. 6 - 3 - Implementing Kruskal-'s Algorithm via Union-Find I (9 min).mp4 13MB
  79. 19 - 2 - The Maximum Cut Problem II (9 min).mp4 13MB
  80. 14 - 5 - Detecting Negative Cycles (9 min) (1).mp4 13MB
  81. 14 - 5 - Detecting Negative Cycles (9 min).mp4 13MB
  82. 17 - 1 - The Vertex Cover Problem (9 min).mp4 13MB
  83. 19 - 1 - The Maximum Cut Problem I (9 min).mp4 12MB
  84. 18 - 3 - Analysis of a Greedy Knapsack Heuristic II (10 min).mp4 12MB
  85. 6 - 2 - Correctness of Kruskal-'s Algorithm (9 min).mp4 12MB
  86. 10 - 5 - Principles of Dynamic Programming (8 min).mp4 12MB
  87. 19 - 3 - Principles of Local Search I (9 min).mp4 12MB
  88. 16 - 4 - Definition and Interpretation of NP-Completeness II (8 min).mp4 12MB
  89. 14 - 3 - The Basic Algorithm I (9 min) (1).mp4 12MB
  90. 14 - 3 - The Basic Algorithm I (9 min).mp4 12MB
  91. 13 - 5 - A Dynamic Programming Algorithm II (9 min) (1).mp4 12MB
  92. 13 - 5 - A Dynamic Programming Algorithm II (9 min).mp4 12MB
  93. 7 - 2 - Correctness of Clustering Algorithm (10 min).mp4 12MB
  94. 9 - 1 - Introduction and Motivation (9 min).mp4 12MB
  95. 10 - 1 - Introduction- Weighted Independent Sets in Path Graphs (8 min).mp4 11MB
  96. 1 - 2 - Application- Sequence Alignment (9 min).mp4 11MB
  97. 6 - 1 - Kruskal-'s MST Algorithm (8 min).mp4 11MB
  98. 14 - 8 - Internet Routing II [Optional] (7 min) (1).mp4 11MB
  99. 14 - 8 - Internet Routing II [Optional] (7 min).mp4 11MB
  100. 17 - 3 - Smarter Search for Vertex Cover II (8 min).mp4 10MB
  101. 5 - 4 - Correctness Proof II (8 min).mp4 10MB
  102. 5 - 2 - Prim-'s MST Algorithm (8 min).mp4 10MB
  103. 13 - 3 - Proof of Optimal Substructure (7 min) (1).mp4 10MB
  104. 13 - 3 - Proof of Optimal Substructure (7 min).mp4 10MB
  105. 4 - 5 - Handling Ties [Advanced - Optional] (7 min).mp4 10MB
  106. 10 - 4 - WIS in Path Graphs- A Reconstruction Algorithm (7 min).mp4 10MB
  107. 15 - 1 - Problem Definition (7 min) (1).mp4 9MB
  108. 15 - 1 - Problem Definition (7 min) (2).mp4 9MB
  109. 15 - 1 - Problem Definition (7 min).mp4 9MB
  110. 4 - 3 - Correctness Proof - Part I (7 min).mp4 9MB
  111. 18 - 2 - Analysis of a Greedy Knapsack Heuristic I (7 min).mp4 9MB
  112. 4 - 1 - Problem Definition (6 min).mp4 8MB
  113. 4 - 4 - Correctness Proof - Part II (5 min).mp4 6MB
  114. 9 - 4 - A More Complex Example (4 min).mp4 6MB
  115. 2 - 8 - Data Structures- Overview [Part I Review - Optional] (5 min).mp4 5MB
  116. 2 - 4 - Big-Oh Notation [Part I Review - Optional] (4 min).mp4 4MB
  117. 20 - 4 - Epilogue (1 min).mp4 2MB
  118. 5 - 5 - Proof of Cut Property [Advanced - Optional] (12 min).mp4 61KB