589689.xyz

Algorithms_ Design and Analysis, Part 2

  • 收录时间:2021-04-25 21:39:21
  • 文件大小:2GB
  • 下载次数:1
  • 最近下载:2021-04-25 21:39:21
  • 磁力链接:
立即下载 复制链接

文件列表

  1. 9 - IX. HUFFMAN CODES (Week 2)/3 - Video (MP4) for A Greedy Algorithm (17 min).mp4 25MB
  2. 2 - II. SELECTED REVIEW FROM PART I (Week 1)/6 - Video (MP4) for Graph Search - Overview [Part I Review - Optional] (23 min).mp4 24MB
  3. 8 - VIII. ADVANCED UNION-FIND (Week 2)/7 - Video (MP4) for The Ackermann Function [Advanced - Optional](17 min).mp4 23MB
  4. 20 - XX. THE WIDER WORLD OF ALGORITHMS (Week 6)/1 - Video (MP4) for Stable Matching [Optional] (15 min).mp4 23MB
  5. 8 - VIII. ADVANCED UNION-FIND (Week 2)/3 - Video (MP4) for Analysis of Union-by-Rank [Advanced - Optional](15).mp4 22MB
  6. 2 - II. SELECTED REVIEW FROM PART I (Week 1)/7 - Video (MP4) for Dijkstra's Shortest-Path Algorithm [Part I Review - Optional] (21 min).mp4 22MB
  7. 19 - XIX. LOCAL SEARCH ALGORITHMS (Week 6)/7 - Video (MP4) for Analysis of Papadimitriou's Algorithm (15 min).mp4 22MB
  8. 8 - VIII. ADVANCED UNION-FIND (Week 2)/4 - Video (MP4) for Path Compression [Advanced - Optional] (15).mp4 22MB
  9. 19 - XIX. LOCAL SEARCH ALGORITHMS (Week 6)/6 - Video (MP4) for Random Walks on a Line (16 min).mp4 21MB
  10. 17 - XVII. FASTER EXACT ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 5)/4 - Video (MP4) for The Traveling Salesman Problem (15 min).mp4 21MB
  11. 20 - XX. THE WIDER WORLD OF ALGORITHMS (Week 6)/2 - Video (MP4) for Matchings, Flows, and Braess's Paradox [Optional] (14 min).mp4 21MB
  12. 8 - VIII. ADVANCED UNION-FIND (Week 2)/8 - Video (MP4) for Path Compression_ Tarjan's Analysis I [Advanced - Optional].mp4 21MB
  13. 16 - XVI. NP-COMPLETE PROBLEMS (Week 5)/1 - Video (MP4) for Polynomial-Time Solvable Problems (14 min).mp4 20MB
  14. 2 - II. SELECTED REVIEW FROM PART I (Week 1)/2 - Video (MP4) for Why Study Algorithms_ [Part I Review - Optional] (19 min).mp4 20MB
  15. 16 - XVI. NP-COMPLETE PROBLEMS (Week 5)/2 - Video (MP4) for Reductions and Completeness (14 min).mp4 20MB
  16. 16 - XVI. NP-COMPLETE PROBLEMS (Week 5)/6 - Video (MP4) for Algorithmic Approaches to NP-Complete Problems (13 min).mp4 20MB
  17. 5 - V. PRIM'S MINIMUM SPANNING TREE ALGORITHM (Week 1)/6 - Video (MP4) for Fast Implementation I (15 min).mp4 20MB
  18. 19 - XIX. LOCAL SEARCH ALGORITHMS (Week 6)/5 - Video (MP4) for The 2-SAT Problem (15 min).mp4 20MB
  19. 15 - XV. ALL-PAIRS SHORTEST PATHS (Week 4)/4 - Video (MP4) for A Reweighting Technique (14 min).mp4 20MB
  20. 12 - XII. SEQUENCE ALIGNMENT (Week 3)/1 - Video (MP4) for Optimal Substructure (14 min).mp4 20MB
  21. 2 - II. SELECTED REVIEW FROM PART I (Week 1)/9 - Video (MP4) for Heaps_ Operations and Applications [Part I Review - Optional] (18).mp4 19MB
  22. 8 - VIII. ADVANCED UNION-FIND (Week 2)/9 - Video (MP4) for Path Compression_ Tarjan's Analysis II [Advanced - Optional].mp4 19MB
  23. 5 - V. PRIM'S MINIMUM SPANNING TREE ALGORITHM (Week 1)/3 - Video (MP4) for Correctness Proof I (16 min).mp4 19MB
  24. 15 - XV. ALL-PAIRS SHORTEST PATHS (Week 4)/3 - Video (MP4) for The Floyd-Warshall Algorithm (13 min).mp4 19MB
  25. 6 - VI. KRUSKAL'S MINIMUM SPANNING TREE ALGORITHM (Week 2)/4 - Video (MP4) for Implementing Kruskal's Algorithm via Union-Find II (14 min).mp4 19MB
  26. 2 - II. SELECTED REVIEW FROM PART I (Week 1)/3 - Video (MP4) for Guiding Principles for Analysis of Algorithms [Part I Review - Optional] (15 min).mp4 19MB
  27. 18 - XVIII. APPROXIMATION ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 6)/6 - Video (MP4) for Ananysis of Dynamic Programming Heuristic (15 min).mp4 19MB
  28. 18 - XVIII. APPROXIMATION ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 6)/1 - Video (MP4) for A Greedy Knapsack Heuristic (14 min).mp4 19MB
  29. 14 - XIV. THE BELLMAN-FORD ALGORITHM (Week 4)/6 - Video (MP4) for A Space Optimization (12 min).mp4 18MB
  30. 2 - II. SELECTED REVIEW FROM PART I (Week 1)/1 - Video (MP4) for About the Course [Part I Review - Optional] (17 min).mp4 18MB
  31. 8 - VIII. ADVANCED UNION-FIND (Week 2)/2 - Video (MP4) for Union-by-Rank [Advanced - Optional] (12 min).mp4 18MB
  32. 3 - III. INTRODUCTION TO GREEDY ALGORITHMS (Week 1)/1 - Video (MP4) for Introduction to Greedy Algorithms (13 min).mp4 18MB
  33. 17 - XVII. FASTER EXACT ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 5)/5 - Video (MP4) for A Dynamic Programming Algorithm for TSP (12 min).mp4 17MB
  34. 13 - XIII. OPTIMAL BINARY SEARCH TREES (Week 3)/1 - Video (MP4) for Problem Definition (12 min).mp4 17MB
  35. 8 - VIII. ADVANCED UNION-FIND (Week 2)/6 - Video (MP4) for Path Compression_ The Hopcroft-Ullman Analysis II [Advanced - Optional].mp4 17MB
  36. 4 - IV. A SCHEDULING APPLICATION (Week 1)/2 - Video (MP4) for A Greedy Algorithm (13 min).mp4 17MB
  37. 15 - XV. ALL-PAIRS SHORTEST PATHS (Week 4)/6 - Video (MP4) for Johnson's Algorithm II (11 min).mp4 17MB
  38. 20 - XX. THE WIDER WORLD OF ALGORITHMS (Week 6)/3 - Video (MP4) for Linear Programming and Beyond [Optional] (11 min).mp4 17MB
  39. 9 - IX. HUFFMAN CODES (Week 2)/5 - Video (MP4) for Correctness Proof II (13 min).mp4 17MB
  40. 14 - XIV. THE BELLMAN-FORD ALGORITHM (Week 4)/7 - Video (MP4) for Internet Routing I [Optional] (11 min).mp4 17MB
  41. 12 - XII. SEQUENCE ALIGNMENT (Week 3)/2 - Video (MP4) for A Dynamic Programming Algorithm (12 min).mp4 17MB
  42. 15 - XV. ALL-PAIRS SHORTEST PATHS (Week 4)/2 - Video (MP4) for Optimal Substructure (12 min).mp4 17MB
  43. 16 - XVI. NP-COMPLETE PROBLEMS (Week 5)/3 - Video (MP4) for Definition and Interpretation of NP-Completeness I (11 min).mp4 16MB
  44. 15 - XV. ALL-PAIRS SHORTEST PATHS (Week 4)/5 - Video (MP4) for Johnson's Algorithm I (11 min).mp4 15MB
  45. 18 - XVIII. APPROXIMATION ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 6)/4 - Video (MP4) for A Dynamic Programming Heuristic for Knapsack (12 min).mp4 15MB
  46. 9 - IX. HUFFMAN CODES (Week 2)/2 - Video (MP4) for Problem Definition (10 min).mp4 15MB
  47. 14 - XIV. THE BELLMAN-FORD ALGORITHM (Week 4)/2 - Video (MP4) for Optimal Substructure (11 min).mp4 15MB
  48. 8 - VIII. ADVANCED UNION-FIND (Week 2)/1 - Video (MP4) for Lazy Unions [Advanced - Optional] (10 min).mp4 15MB
  49. 14 - XIV. THE BELLMAN-FORD ALGORITHM (Week 4)/1 - Video (MP4) for Single-Source Shortest Paths, Revisted (11 min).mp4 15MB
  50. 7 - VII. CLUSTERING (Week 2)/1 - Video (MP4) for Application to Clustering (12 min).mp4 15MB
  51. 5 - V. PRIM'S MINIMUM SPANNING TREE ALGORITHM (Week 1)/1 - Video (MP4) for MST Problem Definition (11 min).mp4 15MB
  52. 5 - V. PRIM'S MINIMUM SPANNING TREE ALGORITHM (Week 1)/5 - Video (MP4) for Proof of Cut Property [Advanced - Optional] (12 min).mp4 15MB
  53. 3 - III. INTRODUCTION TO GREEDY ALGORITHMS (Week 1)/2 - Video (MP4) for Application_ Optimal Caching (11 min).mp4 15MB
  54. 10 - X. INTRODUCTION TO DYNAMIC PROGRAMMING (Week 3)/3 - Video (MP4) for WIS in Path Graphs_ A Linear-Time Algorithm (10 min).mp4 15MB
  55. 19 - XIX. LOCAL SEARCH ALGORITHMS (Week 6)/4 - Video (MP4) for Principles of Local Search II (10 min).mp4 14MB
  56. 2 - II. SELECTED REVIEW FROM PART I (Week 1)/5 - Video (MP4) for Graph Representations [Part I Review - Optional] (14 min).mp4 14MB
  57. 16 - XVI. NP-COMPLETE PROBLEMS (Week 5)/5 - Video (MP4) for The P vs. NP Question (9 min).mp4 14MB
  58. 6 - VI. KRUSKAL'S MINIMUM SPANNING TREE ALGORITHM (Week 2)/5 - Video (MP4) for MSTs_ State-of-the-Art and Open Questions [Advanced - Optional] (9 min).mp4 14MB
  59. 17 - XVII. FASTER EXACT ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 5)/2 - Video (MP4) for Smarter Search for Vertex Cover I (10 min).mp4 14MB
  60. 11 - XI. THE KNAPSACK PROBLEM (Week 3)/1 - Video (MP4) for The Knapsack Problem (10 min).mp4 14MB
  61. 13 - XIII. OPTIMAL BINARY SEARCH TREES (Week 3)/4 - Video (MP4) for A Dynamic Programming Algorithm I (10 min).mp4 14MB
  62. 13 - XIII. OPTIMAL BINARY SEARCH TREES (Week 3)/2 - Video (MP4) for Optimal Substructure (9 min).mp4 14MB
  63. 1 - I. TWO MOTIVATING APPLICATIONS (Week 1)/1 - Video (MP4) for Application_ Internet Routing (11 min).mp4 14MB
  64. 8 - VIII. ADVANCED UNION-FIND (Week 2)/5 - Video (MP4) for Path Compression_ The Hopcroft-Ullman Analysis I [Advanced - Optional].mp4 14MB
  65. 11 - XI. THE KNAPSACK PROBLEM (Week 3)/2 - Video (MP4) for A Dynamic Programming Algorithm (10 min).mp4 14MB
  66. 14 - XIV. THE BELLMAN-FORD ALGORITHM (Week 4)/4 - Video (MP4) for The Basic Algorithm II (11 min).mp4 14MB
  67. 10 - X. INTRODUCTION TO DYNAMIC PROGRAMMING (Week 3)/2 - Video (MP4) for WIS in Path Graphs_ Optimal Substructure (9 min).mp4 14MB
  68. 9 - IX. HUFFMAN CODES (Week 2)/4 - Video (MP4) for Correctness Proof I (10 min).mp4 13MB
  69. 18 - XVIII. APPROXIMATION ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 6)/5 - Video (MP4) for Knapsack via Dynamic Programming, Revisited (10 min).mp4 13MB
  70. 5 - V. PRIM'S MINIMUM SPANNING TREE ALGORITHM (Week 1)/7 - Video (MP4) for Fast Implementation II (10 min).mp4 13MB
  71. 6 - VI. KRUSKAL'S MINIMUM SPANNING TREE ALGORITHM (Week 2)/3 - Video (MP4) for Implementing Kruskal's Algorithm via Union-Find I (9 min).mp4 13MB
  72. 19 - XIX. LOCAL SEARCH ALGORITHMS (Week 6)/2 - Video (MP4) for The Maximum Cut Problem II (9 min).mp4 13MB
  73. 14 - XIV. THE BELLMAN-FORD ALGORITHM (Week 4)/5 - Video (MP4) for Detecting Negative Cycles (9 min).mp4 13MB
  74. 17 - XVII. FASTER EXACT ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 5)/1 - Video (MP4) for The Vertex Cover Problem (9 min).mp4 13MB
  75. 19 - XIX. LOCAL SEARCH ALGORITHMS (Week 6)/1 - Video (MP4) for The Maximum Cut Problem I (9 min).mp4 12MB
  76. 18 - XVIII. APPROXIMATION ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 6)/3 - Video (MP4) for Analysis of a Greedy Knapsack Heuristic II (10 min).mp4 12MB
  77. 6 - VI. KRUSKAL'S MINIMUM SPANNING TREE ALGORITHM (Week 2)/2 - Video (MP4) for Correctness of Kruskal's Algorithm (9 min).mp4 12MB
  78. 10 - X. INTRODUCTION TO DYNAMIC PROGRAMMING (Week 3)/5 - Video (MP4) for Principles of Dynamic Programming (8 min).mp4 12MB
  79. 19 - XIX. LOCAL SEARCH ALGORITHMS (Week 6)/3 - Video (MP4) for Principles of Local Search I (9 min).mp4 12MB
  80. 16 - XVI. NP-COMPLETE PROBLEMS (Week 5)/4 - Video (MP4) for Definition and Interpretation of NP-Completeness II (8 min).mp4 12MB
  81. 14 - XIV. THE BELLMAN-FORD ALGORITHM (Week 4)/3 - Video (MP4) for The Basic Algorithm I (9 min).mp4 12MB
  82. 13 - XIII. OPTIMAL BINARY SEARCH TREES (Week 3)/5 - Video (MP4) for A Dynamic Programming Algorithm II (9 min).mp4 12MB
  83. 7 - VII. CLUSTERING (Week 2)/2 - Video (MP4) for Correctness of Clustering Algorithm (10 min).mp4 12MB
  84. 9 - IX. HUFFMAN CODES (Week 2)/1 - Video (MP4) for Introduction and Motivation (9 min).mp4 12MB
  85. 10 - X. INTRODUCTION TO DYNAMIC PROGRAMMING (Week 3)/1 - Video (MP4) for Introduction_ Weighted Independent Sets in Path Graphs (8 min).mp4 11MB
  86. 1 - I. TWO MOTIVATING APPLICATIONS (Week 1)/2 - Video (MP4) for Application_ Sequence Alignment (9 min).mp4 11MB
  87. 6 - VI. KRUSKAL'S MINIMUM SPANNING TREE ALGORITHM (Week 2)/1 - Video (MP4) for Kruskal's MST Algorithm (8 min).mp4 11MB
  88. 14 - XIV. THE BELLMAN-FORD ALGORITHM (Week 4)/8 - Video (MP4) for Internet Routing II [Optional] (7 min).mp4 11MB
  89. 17 - XVII. FASTER EXACT ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 5)/3 - Video (MP4) for Smarter Search for Vertex Cover II (8 min).mp4 10MB
  90. 5 - V. PRIM'S MINIMUM SPANNING TREE ALGORITHM (Week 1)/4 - Video (MP4) for Correctness Proof II (8 min).mp4 10MB
  91. 5 - V. PRIM'S MINIMUM SPANNING TREE ALGORITHM (Week 1)/2 - Video (MP4) for Prim's MST Algorithm (8 min).mp4 10MB
  92. 13 - XIII. OPTIMAL BINARY SEARCH TREES (Week 3)/3 - Video (MP4) for Proof of Optimal Substructure (7 min).mp4 10MB
  93. 4 - IV. A SCHEDULING APPLICATION (Week 1)/5 - Video (MP4) for Handling Ties [Advanced - Optional] (7 min).mp4 10MB
  94. 10 - X. INTRODUCTION TO DYNAMIC PROGRAMMING (Week 3)/4 - Video (MP4) for WIS in Path Graphs_ A Reconstruction Algorithm (7 min).mp4 10MB
  95. 15 - XV. ALL-PAIRS SHORTEST PATHS (Week 4)/1 - Video (MP4) for Problem Definition (7 min).mp4 9MB
  96. 4 - IV. A SCHEDULING APPLICATION (Week 1)/3 - Video (MP4) for Correctness Proof - Part I (7 min).mp4 9MB
  97. 18 - XVIII. APPROXIMATION ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 6)/2 - Video (MP4) for Analysis of a Greedy Knapsack Heuristic I (7 min).mp4 9MB
  98. 4 - IV. A SCHEDULING APPLICATION (Week 1)/1 - Video (MP4) for Problem Definition (6 min).mp4 8MB
  99. 4 - IV. A SCHEDULING APPLICATION (Week 1)/4 - Video (MP4) for Correctness Proof - Part II (5 min).mp4 6MB
  100. 20 - XX. THE WIDER WORLD OF ALGORITHMS (Week 6)/3 - Slides (PDF) for Linear Programming and Beyond [Optional] (11 min).pdf 5MB
  101. 20 - XX. THE WIDER WORLD OF ALGORITHMS (Week 6)/2 - Slides (PDF) for Matchings, Flows, and Braess's Paradox [Optional] (14 min).pdf 5MB
  102. 20 - XX. THE WIDER WORLD OF ALGORITHMS (Week 6)/1 - Slides (PDF) for Stable Matching [Optional] (15 min).pdf 5MB
  103. 2 - II. SELECTED REVIEW FROM PART I (Week 1)/8 - Video (MP4) for Data Structures_ Overview [Part I Review - Optional] (5).mp4 5MB
  104. 2 - II. SELECTED REVIEW FROM PART I (Week 1)/4 - Video (MP4) for Big-Oh Notation [Part I Review - Optional] (4 min).mp4 4MB
  105. 9 - IX. HUFFMAN CODES (Week 2)/5 - Slides (PDF) for Correctness Proof II (13 min).pdf 3MB
  106. 9 - IX. HUFFMAN CODES (Week 2)/4 - Slides (PDF) for Correctness Proof I (10 min).pdf 3MB
  107. 8 - VIII. ADVANCED UNION-FIND (Week 2)/8 - Slides (PDF) for Path Compression_ Tarjan's Analysis I [Advanced - Optional].pdf 3MB
  108. 8 - VIII. ADVANCED UNION-FIND (Week 2)/9 - Slides (PDF) for Path Compression_ Tarjan's Analysis II [Advanced - Optional].pdf 3MB
  109. 6 - VI. KRUSKAL'S MINIMUM SPANNING TREE ALGORITHM (Week 2)/3 - Slides (PDF) for Implementing Kruskal's Algorithm via Union-Find I (9 min).pdf 3MB
  110. 6 - VI. KRUSKAL'S MINIMUM SPANNING TREE ALGORITHM (Week 2)/4 - Slides (PDF) for Implementing Kruskal's Algorithm via Union-Find II (14 min).pdf 3MB
  111. 5 - V. PRIM'S MINIMUM SPANNING TREE ALGORITHM (Week 1)/6 - Slides (PDF) for Fast Implementation I (15 min).pdf 3MB
  112. 5 - V. PRIM'S MINIMUM SPANNING TREE ALGORITHM (Week 1)/7 - Slides (PDF) for Fast Implementation II (10 min).pdf 3MB
  113. 13 - XIII. OPTIMAL BINARY SEARCH TREES (Week 3)/3 - Slides (PDF) for Proof of Optimal Substructure (7 min).pdf 3MB
  114. 13 - XIII. OPTIMAL BINARY SEARCH TREES (Week 3)/2 - Slides (PDF) for Optimal Substructure (9 min).pdf 3MB
  115. 19 - XIX. LOCAL SEARCH ALGORITHMS (Week 6)/1 - Slides (PDF) for The Maximum Cut Problem I (9 min).pdf 3MB
  116. 19 - XIX. LOCAL SEARCH ALGORITHMS (Week 6)/2 - Slides (PDF) for The Maximum Cut Problem II (9 min).pdf 3MB
  117. 15 - XV. ALL-PAIRS SHORTEST PATHS (Week 4)/6 - Slides (PDF) for Johnson's Algorithm II (11 min).pdf 3MB
  118. 15 - XV. ALL-PAIRS SHORTEST PATHS (Week 4)/5 - Slides (PDF) for Johnson's Algorithm I (11 min).pdf 3MB
  119. 8 - VIII. ADVANCED UNION-FIND (Week 2)/6 - Slides (PDF) for Path Compression_ The Hopcroft-Ullman Analysis II [Advanced - Optional].pdf 3MB
  120. 8 - VIII. ADVANCED UNION-FIND (Week 2)/5 - Slides (PDF) for Path Compression_ The Hopcroft-Ullman Analysis I [Advanced - Optional].pdf 3MB
  121. 17 - XVII. FASTER EXACT ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 5)/4 - Slides (PDF) for The Traveling Salesman Problem (15 min).pdf 3MB
  122. 13 - XIII. OPTIMAL BINARY SEARCH TREES (Week 3)/5 - Slides (PDF) for A Dynamic Programming Algorithm II (9 min).pdf 3MB
  123. 13 - XIII. OPTIMAL BINARY SEARCH TREES (Week 3)/4 - Slides (PDF) for A Dynamic Programming Algorithm I (10 min).pdf 3MB
  124. 18 - XVIII. APPROXIMATION ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 6)/2 - Slides (PDF) for Analysis of a Greedy Knapsack Heuristic I (7 min).pdf 3MB
  125. 18 - XVIII. APPROXIMATION ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 6)/3 - Slides (PDF) for Analysis of a Greedy Knapsack Heuristic II (10 min).pdf 3MB
  126. 2 - II. SELECTED REVIEW FROM PART I (Week 1)/7 - Slides (PDF) for Dijkstra's Shortest-Path Algorithm [Part I Review - Optional] (21 min).pdf 3MB
  127. 17 - XVII. FASTER EXACT ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 5)/2 - Slides (PDF) for Smarter Search for Vertex Cover I (10 min).pdf 3MB
  128. 17 - XVII. FASTER EXACT ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 5)/3 - Slides (PDF) for Smarter Search for Vertex Cover II (8 min).pdf 3MB
  129. 9 - IX. HUFFMAN CODES (Week 2)/3 - Slides (PDF) for A Greedy Algorithm (17 min).pdf 3MB
  130. 19 - XIX. LOCAL SEARCH ALGORITHMS (Week 6)/3 - Slides (PDF) for Principles of Local Search I (9 min).pdf 3MB
  131. 19 - XIX. LOCAL SEARCH ALGORITHMS (Week 6)/4 - Slides (PDF) for Principles of Local Search II (10 min).pdf 3MB
  132. 8 - VIII. ADVANCED UNION-FIND (Week 2)/3 - Slides (PDF) for Analysis of Union-by-Rank [Advanced - Optional](15).pdf 3MB
  133. 19 - XIX. LOCAL SEARCH ALGORITHMS (Week 6)/7 - Slides (PDF) for Analysis of Papadimitriou's Algorithm (15 min).pdf 2MB
  134. 8 - VIII. ADVANCED UNION-FIND (Week 2)/7 - Slides (PDF) for The Ackermann Function [Advanced - Optional](17 min).pdf 2MB
  135. 5 - V. PRIM'S MINIMUM SPANNING TREE ALGORITHM (Week 1)/3 - Slides (PDF) for Correctness Proof I (16 min).pdf 2MB
  136. 15 - XV. ALL-PAIRS SHORTEST PATHS (Week 4)/4 - Slides (PDF) for A Reweighting Technique (14 min).pdf 2MB
  137. 12 - XII. SEQUENCE ALIGNMENT (Week 3)/1 - Slides (PDF) for Optimal Substructure (14 min).pdf 2MB
  138. 14 - XIV. THE BELLMAN-FORD ALGORITHM (Week 4)/4 - Slides (PDF) for The Basic Algorithm II (11 min).pdf 2MB
  139. 14 - XIV. THE BELLMAN-FORD ALGORITHM (Week 4)/3 - Slides (PDF) for The Basic Algorithm I (9 min).pdf 2MB
  140. 2 - II. SELECTED REVIEW FROM PART I (Week 1)/6 - Slides (PDF) for Graph Search - Overview [Part I Review - Optional] (23 min).pdf 2MB
  141. 19 - XIX. LOCAL SEARCH ALGORITHMS (Week 6)/6 - Slides (PDF) for Random Walks on a Line (16 min).pdf 2MB
  142. 12 - XII. SEQUENCE ALIGNMENT (Week 3)/2 - Slides (PDF) for A Dynamic Programming Algorithm (12 min).pdf 2MB
  143. 16 - XVI. NP-COMPLETE PROBLEMS (Week 5)/3 - Slides (PDF) for Definition and Interpretation of NP-Completeness I (11 min).pdf 2MB
  144. 16 - XVI. NP-COMPLETE PROBLEMS (Week 5)/4 - Slides (PDF) for Definition and Interpretation of NP-Completeness II (8 min).pdf 2MB
  145. 14 - XIV. THE BELLMAN-FORD ALGORITHM (Week 4)/6 - Slides (PDF) for A Space Optimization (12 min).pdf 2MB
  146. 5 - V. PRIM'S MINIMUM SPANNING TREE ALGORITHM (Week 1)/5 - Slides (PDF) for Proof of Cut Property [Advanced - Optional] (12 min).pdf 2MB
  147. 8 - VIII. ADVANCED UNION-FIND (Week 2)/2 - Slides (PDF) for Union-by-Rank [Advanced - Optional] (12 min).pdf 2MB
  148. 2 - II. SELECTED REVIEW FROM PART I (Week 1)/9 - Slides (PDF) for Heaps_ Operations and Applications [Part I Review - Optional] (18).pdf 2MB
  149. 1 - I. TWO MOTIVATING APPLICATIONS (Week 1)/2 - Slides (PDF) for Application_ Sequence Alignment (9 min).pdf 2MB
  150. 17 - XVII. FASTER EXACT ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 5)/5 - Slides (PDF) for A Dynamic Programming Algorithm for TSP (12 min).pdf 2MB
  151. 18 - XVIII. APPROXIMATION ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 6)/1 - Slides (PDF) for A Greedy Knapsack Heuristic (14 min).pdf 2MB
  152. 18 - XVIII. APPROXIMATION ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 6)/6 - Slides (PDF) for Ananysis of Dynamic Programming Heuristic (15 min).pdf 2MB
  153. 8 - VIII. ADVANCED UNION-FIND (Week 2)/4 - Slides (PDF) for Path Compression [Advanced - Optional] (15).pdf 2MB
  154. 14 - XIV. THE BELLMAN-FORD ALGORITHM (Week 4)/2 - Slides (PDF) for Optimal Substructure (11 min).pdf 2MB
  155. 13 - XIII. OPTIMAL BINARY SEARCH TREES (Week 3)/1 - Slides (PDF) for Problem Definition (12 min).pdf 2MB
  156. 9 - IX. HUFFMAN CODES (Week 2)/2 - Slides (PDF) for Problem Definition (10 min).pdf 2MB
  157. 15 - XV. ALL-PAIRS SHORTEST PATHS (Week 4)/3 - Slides (PDF) for The Floyd-Warshall Algorithm (13 min).pdf 2MB
  158. 15 - XV. ALL-PAIRS SHORTEST PATHS (Week 4)/2 - Slides (PDF) for Optimal Substructure (12 min).pdf 2MB
  159. 16 - XVI. NP-COMPLETE PROBLEMS (Week 5)/1 - Slides (PDF) for Polynomial-Time Solvable Problems (14 min).pdf 2MB
  160. 14 - XIV. THE BELLMAN-FORD ALGORITHM (Week 4)/1 - Slides (PDF) for Single-Source Shortest Paths, Revisted (11 min).pdf 2MB
  161. 2 - II. SELECTED REVIEW FROM PART I (Week 1)/5 - Slides (PDF) for Graph Representations [Part I Review - Optional] (14 min).pdf 2MB
  162. 7 - VII. CLUSTERING (Week 2)/1 - Slides (PDF) for Application to Clustering (12 min).pdf 2MB
  163. 20 - XX. THE WIDER WORLD OF ALGORITHMS (Week 6)/4 - Video (MP4) for Epilogue (1 min).mp4 2MB
  164. 16 - XVI. NP-COMPLETE PROBLEMS (Week 5)/2 - Slides (PDF) for Reductions and Completeness (14 min).pdf 2MB
  165. 3 - III. INTRODUCTION TO GREEDY ALGORITHMS (Week 1)/1 - Slides (PDF) for Introduction to Greedy Algorithms (13 min).pdf 2MB
  166. 19 - XIX. LOCAL SEARCH ALGORITHMS (Week 6)/5 - Slides (PDF) for The 2-SAT Problem (15 min).pdf 2MB
  167. 14 - XIV. THE BELLMAN-FORD ALGORITHM (Week 4)/7 - Slides (PDF) for Internet Routing I [Optional] (11 min).pdf 2MB
  168. 14 - XIV. THE BELLMAN-FORD ALGORITHM (Week 4)/8 - Slides (PDF) for Internet Routing II [Optional] (7 min).pdf 2MB
  169. 10 - X. INTRODUCTION TO DYNAMIC PROGRAMMING (Week 3)/2 - Slides (PDF) for WIS in Path Graphs_ Optimal Substructure (9 min).pdf 2MB
  170. 18 - XVIII. APPROXIMATION ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 6)/4 - Slides (PDF) for A Dynamic Programming Heuristic for Knapsack (12 min).pdf 2MB
  171. 9 - IX. HUFFMAN CODES (Week 2)/1 - Slides (PDF) for Introduction and Motivation (9 min).pdf 2MB
  172. 8 - VIII. ADVANCED UNION-FIND (Week 2)/1 - Slides (PDF) for Lazy Unions [Advanced - Optional] (10 min).pdf 2MB
  173. 4 - IV. A SCHEDULING APPLICATION (Week 1)/2 - Slides (PDF) for A Greedy Algorithm (13 min).pdf 2MB
  174. 7 - VII. CLUSTERING (Week 2)/2 - Slides (PDF) for Correctness of Clustering Algorithm (10 min).pdf 2MB
  175. 5 - V. PRIM'S MINIMUM SPANNING TREE ALGORITHM (Week 1)/1 - Slides (PDF) for MST Problem Definition (11 min).pdf 2MB
  176. 10 - X. INTRODUCTION TO DYNAMIC PROGRAMMING (Week 3)/3 - Slides (PDF) for WIS in Path Graphs_ A Linear-Time Algorithm (10 min).pdf 2MB
  177. 6 - VI. KRUSKAL'S MINIMUM SPANNING TREE ALGORITHM (Week 2)/2 - Slides (PDF) for Correctness of Kruskal's Algorithm (9 min).pdf 2MB
  178. 11 - XI. THE KNAPSACK PROBLEM (Week 3)/1 - Slides (PDF) for The Knapsack Problem (10 min).pdf 1MB
  179. 18 - XVIII. APPROXIMATION ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 6)/5 - Slides (PDF) for Knapsack via Dynamic Programming, Revisited (10 min).pdf 1MB
  180. 11 - XI. THE KNAPSACK PROBLEM (Week 3)/2 - Slides (PDF) for A Dynamic Programming Algorithm (10 min).pdf 1MB
  181. 1 - I. TWO MOTIVATING APPLICATIONS (Week 1)/1 - Slides (PDF) for Application_ Internet Routing (11 min).pdf 1MB
  182. 2 - II. SELECTED REVIEW FROM PART I (Week 1)/3 - Slides (PDF) for Guiding Principles for Analysis of Algorithms [Part I Review - Optional] (15 min).pdf 1MB
  183. 4 - IV. A SCHEDULING APPLICATION (Week 1)/5 - Slides (PDF) for Handling Ties [Advanced - Optional] (7 min).pdf 1MB
  184. 4 - IV. A SCHEDULING APPLICATION (Week 1)/3 - Slides (PDF) for Correctness Proof - Part I (7 min).pdf 1MB
  185. 16 - XVI. NP-COMPLETE PROBLEMS (Week 5)/5 - Slides (PDF) for The P vs. NP Question (9 min).pdf 1MB
  186. 2 - II. SELECTED REVIEW FROM PART I (Week 1)/2 - Slides (PDF) for Why Study Algorithms_ [Part I Review - Optional] (19 min).pdf 1MB
  187. 6 - VI. KRUSKAL'S MINIMUM SPANNING TREE ALGORITHM (Week 2)/5 - Slides (PDF) for MSTs_ State-of-the-Art and Open Questions [Advanced - Optional] (9 min).pdf 1MB
  188. 14 - XIV. THE BELLMAN-FORD ALGORITHM (Week 4)/5 - Slides (PDF) for Detecting Negative Cycles (9 min).pdf 1MB
  189. 17 - XVII. FASTER EXACT ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 5)/1 - Slides (PDF) for The Vertex Cover Problem (9 min).pdf 1MB
  190. 10 - X. INTRODUCTION TO DYNAMIC PROGRAMMING (Week 3)/1 - Slides (PDF) for Introduction_ Weighted Independent Sets in Path Graphs (8 min).pdf 1MB
  191. 10 - X. INTRODUCTION TO DYNAMIC PROGRAMMING (Week 3)/4 - Slides (PDF) for WIS in Path Graphs_ A Reconstruction Algorithm (7 min).pdf 1MB
  192. 3 - III. INTRODUCTION TO GREEDY ALGORITHMS (Week 1)/2 - Slides (PDF) for Application_ Optimal Caching (11 min).pdf 1MB
  193. 5 - V. PRIM'S MINIMUM SPANNING TREE ALGORITHM (Week 1)/2 - Slides (PDF) for Prim's MST Algorithm (8 min).pdf 1MB
  194. 16 - XVI. NP-COMPLETE PROBLEMS (Week 5)/6 - Slides (PDF) for Algorithmic Approaches to NP-Complete Problems (13 min).pdf 1MB
  195. 5 - V. PRIM'S MINIMUM SPANNING TREE ALGORITHM (Week 1)/4 - Slides (PDF) for Correctness Proof II (8 min).pdf 1MB
  196. 15 - XV. ALL-PAIRS SHORTEST PATHS (Week 4)/1 - Slides (PDF) for Problem Definition (7 min).pdf 1MB
  197. 4 - IV. A SCHEDULING APPLICATION (Week 1)/4 - Slides (PDF) for Correctness Proof - Part II (5 min).pdf 950KB
  198. 4 - IV. A SCHEDULING APPLICATION (Week 1)/1 - Slides (PDF) for Problem Definition (6 min).pdf 944KB
  199. 10 - X. INTRODUCTION TO DYNAMIC PROGRAMMING (Week 3)/5 - Slides (PDF) for Principles of Dynamic Programming (8 min).pdf 862KB
  200. 2 - II. SELECTED REVIEW FROM PART I (Week 1)/8 - Slides (PDF) for Data Structures_ Overview [Part I Review - Optional] (5).pdf 844KB
  201. 6 - VI. KRUSKAL'S MINIMUM SPANNING TREE ALGORITHM (Week 2)/1 - Slides (PDF) for Kruskal's MST Algorithm (8 min).pdf 752KB
  202. 2 - II. SELECTED REVIEW FROM PART I (Week 1)/4 - Slides (PDF) for Big-Oh Notation [Part I Review - Optional] (4 min).pdf 660KB
  203. 2 - II. SELECTED REVIEW FROM PART I (Week 1)/1 - Slides (PDF) for About the Course [Part I Review - Optional] (17 min).pdf 209KB
  204. 2 - II. SELECTED REVIEW FROM PART I (Week 1)/6 - Subtitles (srt) for Graph Search - Overview [Part I Review - Optional] (23 min).srt 37KB
  205. 2 - II. SELECTED REVIEW FROM PART I (Week 1)/7 - Subtitles (srt) for Dijkstra's Shortest-Path Algorithm [Part I Review - Optional] (21 min).srt 31KB
  206. 2 - II. SELECTED REVIEW FROM PART I (Week 1)/1 - Subtitles (srt) for About the Course [Part I Review - Optional] (17 min).srt 29KB
  207. 2 - II. SELECTED REVIEW FROM PART I (Week 1)/9 - Subtitles (srt) for Heaps_ Operations and Applications [Part I Review - Optional] (18).srt 28KB
  208. 2 - II. SELECTED REVIEW FROM PART I (Week 1)/2 - Subtitles (srt) for Why Study Algorithms_ [Part I Review - Optional] (19 min) 27KB
  209. 2 - II. SELECTED REVIEW FROM PART I (Week 1)/6 - Subtitles (text) for Graph Search - Overview [Part I Review - Optional] (23 min).txt 26KB
  210. 9 - IX. HUFFMAN CODES (Week 2)/3 - Subtitles (srt) for A Greedy Algorithm (17 min).srt 24KB
  211. 2 - II. SELECTED REVIEW FROM PART I (Week 1)/3 - Subtitles (srt) for Guiding Principles for Analysis of Algorithms [Part I Review - Optional] (15 min).srt 24KB
  212. 19 - XIX. LOCAL SEARCH ALGORITHMS (Week 6)/6 - Subtitles (srt) for Random Walks on a Line (16 min).srt 23KB
  213. 5 - V. PRIM'S MINIMUM SPANNING TREE ALGORITHM (Week 1)/6 - Subtitles (srt) for Fast Implementation I (15 min).srt 22KB
  214. 2 - II. SELECTED REVIEW FROM PART I (Week 1)/7 - Subtitles (text) for Dijkstra's Shortest-Path Algorithm [Part I Review - Optional] (21 min).txt 22KB
  215. 2 - II. SELECTED REVIEW FROM PART I (Week 1)/5 - Subtitles (srt) for Graph Representations [Part I Review - Optional] (14 min).srt 22KB
  216. 5 - V. PRIM'S MINIMUM SPANNING TREE ALGORITHM (Week 1)/3 - Subtitles (srt) for Correctness Proof I (16 min).srt 22KB
  217. 17 - XVII. FASTER EXACT ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 5)/4 - Subtitles (srt) for The Traveling Salesman Problem (15 min).srt 21KB
  218. 8 - VIII. ADVANCED UNION-FIND (Week 2)/3 - Subtitles (srt) for Analysis of Union-by-Rank [Advanced - Optional](15).srt 21KB
  219. 19 - XIX. LOCAL SEARCH ALGORITHMS (Week 6)/5 - Subtitles (srt) for The 2-SAT Problem (15 min).srt 21KB
  220. 8 - VIII. ADVANCED UNION-FIND (Week 2)/4 - Subtitles (srt) for Path Compression [Advanced - Optional] (15).srt 21KB
  221. 8 - VIII. ADVANCED UNION-FIND (Week 2)/7 - Subtitles (srt) for The Ackermann Function [Advanced - Optional](17 min).srt 21KB
  222. 6 - VI. KRUSKAL'S MINIMUM SPANNING TREE ALGORITHM (Week 2)/4 - Subtitles (srt) for Implementing Kruskal's Algorithm via Union-Find II (14 min).srt 21KB
  223. 4 - IV. A SCHEDULING APPLICATION (Week 1)/2 - Subtitles (srt) for A Greedy Algorithm (13 min).srt 20KB
  224. 3 - III. INTRODUCTION TO GREEDY ALGORITHMS (Week 1)/1 - Subtitles (srt) for Introduction to Greedy Algorithms (13 min).srt 20KB
  225. 2 - II. SELECTED REVIEW FROM PART I (Week 1)/1 - Subtitles (text) for About the Course [Part I Review - Optional] (17 min).txt 20KB
  226. 15 - XV. ALL-PAIRS SHORTEST PATHS (Week 4)/3 - Subtitles (srt) for The Floyd-Warshall Algorithm (13 min).srt 20KB
  227. 19 - XIX. LOCAL SEARCH ALGORITHMS (Week 6)/7 - Subtitles (srt) for Analysis of Papadimitriou's Algorithm (15 min).srt 20KB
  228. 16 - XVI. NP-COMPLETE PROBLEMS (Week 5)/1 - Subtitles (srt) for Polynomial-Time Solvable Problems (14 min).srt 20KB
  229. 18 - XVIII. APPROXIMATION ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 6)/6 - Subtitles (srt) for Ananysis of Dynamic Programming Heuristic (15 min).srt 20KB
  230. 8 - VIII. ADVANCED UNION-FIND (Week 2)/8 - Subtitles (srt) for Path Compression_ Tarjan's Analysis I [Advanced - Optional].srt 20KB
  231. 18 - XVIII. APPROXIMATION ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 6)/1 - Subtitles (srt) for A Greedy Knapsack Heuristic (14 min).srt 20KB
  232. 12 - XII. SEQUENCE ALIGNMENT (Week 3)/1 - Subtitles (srt) for Optimal Substructure (14 min).srt 19KB
  233. 2 - II. SELECTED REVIEW FROM PART I (Week 1)/9 - Subtitles (text) for Heaps_ Operations and Applications [Part I Review - Optional] (18).txt 19KB
  234. 16 - XVI. NP-COMPLETE PROBLEMS (Week 5)/6 - Subtitles (srt) for Algorithmic Approaches to NP-Complete Problems (13 min).srt 19KB
  235. 9 - IX. HUFFMAN CODES (Week 2)/5 - Subtitles (srt) for Correctness Proof II (13 min).srt 19KB
  236. 15 - XV. ALL-PAIRS SHORTEST PATHS (Week 4)/4 - Subtitles (srt) for A Reweighting Technique (14 min).srt 19KB
  237. 2 - II. SELECTED REVIEW FROM PART I (Week 1)/2 - Subtitles (text) for Why Study Algorithms_ [Part I Review - Optional] (19 min) 19KB
  238. 13 - XIII. OPTIMAL BINARY SEARCH TREES (Week 3)/1 - Subtitles (srt) for Problem Definition (12 min).srt 19KB
  239. 16 - XVI. NP-COMPLETE PROBLEMS (Week 5)/2 - Subtitles (srt) for Reductions and Completeness (14 min).srt 19KB
  240. 20 - XX. THE WIDER WORLD OF ALGORITHMS (Week 6)/2 - Subtitles (srt) for Matchings, Flows, and Braess's Paradox [Optional] (14 min).srt 18KB
  241. 8 - VIII. ADVANCED UNION-FIND (Week 2)/9 - Subtitles (srt) for Path Compression_ Tarjan's Analysis II [Advanced - Optional].srt 18KB
  242. 20 - XX. THE WIDER WORLD OF ALGORITHMS (Week 6)/1 - Subtitles (srt) for Stable Matching [Optional] (15 min).srt 18KB
  243. 15 - XV. ALL-PAIRS SHORTEST PATHS (Week 4)/2 - Subtitles (srt) for Optimal Substructure (12 min).srt 18KB
  244. 8 - VIII. ADVANCED UNION-FIND (Week 2)/2 - Subtitles (srt) for Union-by-Rank [Advanced - Optional] (12 min).srt 18KB
  245. 12 - XII. SEQUENCE ALIGNMENT (Week 3)/2 - Subtitles (srt) for A Dynamic Programming Algorithm (12 min).srt 18KB
  246. 5 - V. PRIM'S MINIMUM SPANNING TREE ALGORITHM (Week 1)/5 - Subtitles (srt) for Proof of Cut Property [Advanced - Optional] (12 min).srt 18KB
  247. 14 - XIV. THE BELLMAN-FORD ALGORITHM (Week 4)/7 - Subtitles (srt) for Internet Routing I [Optional] (11 min).srt 18KB
  248. 14 - XIV. THE BELLMAN-FORD ALGORITHM (Week 4)/6 - Subtitles (srt) for A Space Optimization (12 min).srt 17KB
  249. 9 - IX. HUFFMAN CODES (Week 2)/3 - Subtitles (text) for A Greedy Algorithm (17 min).txt 17KB
  250. 7 - VII. CLUSTERING (Week 2)/1 - Subtitles (srt) for Application to Clustering (12 min).srt 17KB
  251. 17 - XVII. FASTER EXACT ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 5)/5 - Subtitles (srt) for A Dynamic Programming Algorithm for TSP (12 min).srt 17KB
  252. 5 - V. PRIM'S MINIMUM SPANNING TREE ALGORITHM (Week 1)/1 - Subtitles (srt) for MST Problem Definition (11 min).srt 17KB
  253. 1 - I. TWO MOTIVATING APPLICATIONS (Week 1)/1 - Subtitles (srt) for Application_ Internet Routing (11 min).srt 17KB
  254. 19 - XIX. LOCAL SEARCH ALGORITHMS (Week 6)/4 - Subtitles (srt) for Principles of Local Search II (10 min).srt 17KB
  255. 2 - II. SELECTED REVIEW FROM PART I (Week 1)/3 - Subtitles (text) for Guiding Principles for Analysis of Algorithms [Part I Review - Optional] (15 min).txt 16KB
  256. 18 - XVIII. APPROXIMATION ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 6)/4 - Subtitles (srt) for A Dynamic Programming Heuristic for Knapsack (12 min).srt 16KB
  257. 14 - XIV. THE BELLMAN-FORD ALGORITHM (Week 4)/1 - Subtitles (srt) for Single-Source Shortest Paths, Revisted (11 min).srt 16KB
  258. 8 - VIII. ADVANCED UNION-FIND (Week 2)/6 - Subtitles (srt) for Path Compression_ The Hopcroft-Ullman Analysis II [Advanced - Optional].srt 16KB
  259. 20 - XX. THE WIDER WORLD OF ALGORITHMS (Week 6)/3 - Subtitles (srt) for Linear Programming and Beyond [Optional] (11 min).srt 16KB
  260. 19 - XIX. LOCAL SEARCH ALGORITHMS (Week 6)/6 - Subtitles (text) for Random Walks on a Line (16 min).txt 16KB
  261. 3 - III. INTRODUCTION TO GREEDY ALGORITHMS (Week 1)/2 - Subtitles (srt) for Application_ Optimal Caching (11 min).srt 16KB
  262. 15 - XV. ALL-PAIRS SHORTEST PATHS (Week 4)/6 - Subtitles (srt) for Johnson's Algorithm II (11 min).srt 16KB
  263. 14 - XIV. THE BELLMAN-FORD ALGORITHM (Week 4)/2 - Subtitles (srt) for Optimal Substructure (11 min).srt 15KB
  264. 5 - V. PRIM'S MINIMUM SPANNING TREE ALGORITHM (Week 1)/6 - Subtitles (text) for Fast Implementation I (15 min).txt 15KB
  265. 2 - II. SELECTED REVIEW FROM PART I (Week 1)/5 - Subtitles (text) for Graph Representations [Part I Review - Optional] (14 min).txt 15KB
  266. 5 - V. PRIM'S MINIMUM SPANNING TREE ALGORITHM (Week 1)/3 - Subtitles (text) for Correctness Proof I (16 min).txt 15KB
  267. 13 - XIII. OPTIMAL BINARY SEARCH TREES (Week 3)/4 - Subtitles (srt) for A Dynamic Programming Algorithm I (10 min).srt 15KB
  268. 7 - VII. CLUSTERING (Week 2)/2 - Subtitles (srt) for Correctness of Clustering Algorithm (10 min).srt 15KB
  269. 17 - XVII. FASTER EXACT ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 5)/4 - Subtitles (text) for The Traveling Salesman Problem (15 min).txt 15KB
  270. 8 - VIII. ADVANCED UNION-FIND (Week 2)/1 - Subtitles (srt) for Lazy Unions [Advanced - Optional] (10 min).srt 15KB
  271. 14 - XIV. THE BELLMAN-FORD ALGORITHM (Week 4)/4 - Subtitles (srt) for The Basic Algorithm II (11 min).srt 15KB
  272. 16 - XVI. NP-COMPLETE PROBLEMS (Week 5)/3 - Subtitles (srt) for Definition and Interpretation of NP-Completeness I (11 min).srt 15KB
  273. 8 - VIII. ADVANCED UNION-FIND (Week 2)/3 - Subtitles (text) for Analysis of Union-by-Rank [Advanced - Optional](15).txt 15KB
  274. 19 - XIX. LOCAL SEARCH ALGORITHMS (Week 6)/5 - Subtitles (text) for The 2-SAT Problem (15 min).txt 15KB
  275. 9 - IX. HUFFMAN CODES (Week 2)/4 - Subtitles (srt) for Correctness Proof I (10 min).srt 15KB
  276. 15 - XV. ALL-PAIRS SHORTEST PATHS (Week 4)/5 - Subtitles (srt) for Johnson's Algorithm I (11 min).srt 15KB
  277. 6 - VI. KRUSKAL'S MINIMUM SPANNING TREE ALGORITHM (Week 2)/3 - Subtitles (srt) for Implementing Kruskal's Algorithm via Union-Find I (9 min).srt 14KB
  278. 6 - VI. KRUSKAL'S MINIMUM SPANNING TREE ALGORITHM (Week 2)/4 - Subtitles (text) for Implementing Kruskal's Algorithm via Union-Find II (14 min).txt 14KB
  279. 13 - XIII. OPTIMAL BINARY SEARCH TREES (Week 3)/5 - Subtitles (srt) for A Dynamic Programming Algorithm II (9 min).srt 14KB
  280. 9 - IX. HUFFMAN CODES (Week 2)/2 - Subtitles (srt) for Problem Definition (10 min).srt 14KB
  281. 18 - XVIII. APPROXIMATION ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 6)/5 - Subtitles (srt) for Knapsack via Dynamic Programming, Revisited (10 min).srt 14KB
  282. 13 - XIII. OPTIMAL BINARY SEARCH TREES (Week 3)/2 - Subtitles (srt) for Optimal Substructure (9 min).srt 14KB
  283. 8 - VIII. ADVANCED UNION-FIND (Week 2)/4 - Subtitles (text) for Path Compression [Advanced - Optional] (15).txt 14KB
  284. 10 - X. INTRODUCTION TO DYNAMIC PROGRAMMING (Week 3)/3 - Subtitles (srt) for WIS in Path Graphs_ A Linear-Time Algorithm (10 min).srt 14KB
  285. 8 - VIII. ADVANCED UNION-FIND (Week 2)/7 - Subtitles (text) for The Ackermann Function [Advanced - Optional](17 min).txt 14KB
  286. 4 - IV. A SCHEDULING APPLICATION (Week 1)/2 - Subtitles (text) for A Greedy Algorithm (13 min).txt 14KB
  287. 18 - XVIII. APPROXIMATION ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 6)/3 - Subtitles (srt) for Analysis of a Greedy Knapsack Heuristic II (10 min).srt 14KB
  288. 5 - V. PRIM'S MINIMUM SPANNING TREE ALGORITHM (Week 1)/7 - Subtitles (srt) for Fast Implementation II (10 min).srt 14KB
  289. 3 - III. INTRODUCTION TO GREEDY ALGORITHMS (Week 1)/1 - Subtitles (text) for Introduction to Greedy Algorithms (13 min).txt 14KB
  290. 15 - XV. ALL-PAIRS SHORTEST PATHS (Week 4)/3 - Subtitles (text) for The Floyd-Warshall Algorithm (13 min).txt 14KB
  291. 19 - XIX. LOCAL SEARCH ALGORITHMS (Week 6)/7 - Subtitles (text) for Analysis of Papadimitriou's Algorithm (15 min).txt 14KB
  292. 16 - XVI. NP-COMPLETE PROBLEMS (Week 5)/1 - Subtitles (text) for Polynomial-Time Solvable Problems (14 min).txt 14KB
  293. 18 - XVIII. APPROXIMATION ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 6)/6 - Subtitles (text) for Ananysis of Dynamic Programming Heuristic (15 min).txt 14KB
  294. 8 - VIII. ADVANCED UNION-FIND (Week 2)/8 - Subtitles (text) for Path Compression_ Tarjan's Analysis I [Advanced - Optional].txt 14KB
  295. 18 - XVIII. APPROXIMATION ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 6)/1 - Subtitles (text) for A Greedy Knapsack Heuristic (14 min).txt 14KB
  296. 19 - XIX. LOCAL SEARCH ALGORITHMS (Week 6)/2 - Subtitles (srt) for The Maximum Cut Problem II (9 min).srt 14KB
  297. 6 - VI. KRUSKAL'S MINIMUM SPANNING TREE ALGORITHM (Week 2)/5 - Subtitles (srt) for MSTs_ State-of-the-Art and Open Questions [Advanced - Optional] (9 min).srt 14KB
  298. 6 - VI. KRUSKAL'S MINIMUM SPANNING TREE ALGORITHM (Week 2)/2 - Subtitles (srt) for Correctness of Kruskal's Algorithm (9 min).srt 14KB
  299. 11 - XI. THE KNAPSACK PROBLEM (Week 3)/2 - Subtitles (srt) for A Dynamic Programming Algorithm (10 min).srt 14KB
  300. 12 - XII. SEQUENCE ALIGNMENT (Week 3)/1 - Subtitles (text) for Optimal Substructure (14 min).txt 14KB
  301. 19 - XIX. LOCAL SEARCH ALGORITHMS (Week 6)/3 - Subtitles (srt) for Principles of Local Search I (9 min).srt 14KB
  302. 9 - IX. HUFFMAN CODES (Week 2)/5 - Subtitles (text) for Correctness Proof II (13 min).txt 13KB
  303. 16 - XVI. NP-COMPLETE PROBLEMS (Week 5)/6 - Subtitles (text) for Algorithmic Approaches to NP-Complete Problems (13 min).txt 13KB
  304. 15 - XV. ALL-PAIRS SHORTEST PATHS (Week 4)/4 - Subtitles (text) for A Reweighting Technique (14 min).txt 13KB
  305. 11 - XI. THE KNAPSACK PROBLEM (Week 3)/1 - Subtitles (srt) for The Knapsack Problem (10 min).srt 13KB
  306. 14 - XIV. THE BELLMAN-FORD ALGORITHM (Week 4)/5 - Subtitles (srt) for Detecting Negative Cycles (9 min).srt 13KB
  307. 9 - IX. HUFFMAN CODES (Week 2)/1 - Subtitles (srt) for Introduction and Motivation (9 min).srt 13KB
  308. 13 - XIII. OPTIMAL BINARY SEARCH TREES (Week 3)/1 - Subtitles (text) for Problem Definition (12 min).txt 13KB
  309. 8 - VIII. ADVANCED UNION-FIND (Week 2)/5 - Subtitles (srt) for Path Compression_ The Hopcroft-Ullman Analysis I [Advanced - Optional].srt 13KB
  310. 17 - XVII. FASTER EXACT ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 5)/2 - Subtitles (srt) for Smarter Search for Vertex Cover I (10 min).srt 13KB
  311. 16 - XVI. NP-COMPLETE PROBLEMS (Week 5)/2 - Subtitles (text) for Reductions and Completeness (14 min).txt 13KB
  312. 20 - XX. THE WIDER WORLD OF ALGORITHMS (Week 6)/2 - Subtitles (text) for Matchings, Flows, and Braess's Paradox [Optional] (14 min).txt 13KB
  313. 8 - VIII. ADVANCED UNION-FIND (Week 2)/9 - Subtitles (text) for Path Compression_ Tarjan's Analysis II [Advanced - Optional].txt 13KB
  314. 20 - XX. THE WIDER WORLD OF ALGORITHMS (Week 6)/1 - Subtitles (text) for Stable Matching [Optional] (15 min).txt 13KB
  315. 15 - XV. ALL-PAIRS SHORTEST PATHS (Week 4)/2 - Subtitles (text) for Optimal Substructure (12 min).txt 13KB
  316. 8 - VIII. ADVANCED UNION-FIND (Week 2)/2 - Subtitles (text) for Union-by-Rank [Advanced - Optional] (12 min).txt 13KB
  317. 10 - X. INTRODUCTION TO DYNAMIC PROGRAMMING (Week 3)/2 - Subtitles (srt) for WIS in Path Graphs_ Optimal Substructure (9 min).srt 13KB
  318. 12 - XII. SEQUENCE ALIGNMENT (Week 3)/2 - Subtitles (text) for A Dynamic Programming Algorithm (12 min).txt 12KB
  319. 5 - V. PRIM'S MINIMUM SPANNING TREE ALGORITHM (Week 1)/5 - Subtitles (text) for Proof of Cut Property [Advanced - Optional] (12 min).txt 12KB
  320. 1 - I. TWO MOTIVATING APPLICATIONS (Week 1)/2 - Subtitles (srt) for Application_ Sequence Alignment (9 min).srt 12KB
  321. 17 - XVII. FASTER EXACT ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 5)/1 - Subtitles (srt) for The Vertex Cover Problem (9 min).srt 12KB
  322. 16 - XVI. NP-COMPLETE PROBLEMS (Week 5)/5 - Subtitles (srt) for The P vs. NP Question (9 min).srt 12KB
  323. 14 - XIV. THE BELLMAN-FORD ALGORITHM (Week 4)/7 - Subtitles (text) for Internet Routing I [Optional] (11 min).txt 12KB
  324. 6 - VI. KRUSKAL'S MINIMUM SPANNING TREE ALGORITHM (Week 2)/1 - Subtitles (srt) for Kruskal's MST Algorithm (8 min).srt 12KB
  325. 14 - XIV. THE BELLMAN-FORD ALGORITHM (Week 4)/6 - Subtitles (text) for A Space Optimization (12 min).txt 12KB
  326. 10 - X. INTRODUCTION TO DYNAMIC PROGRAMMING (Week 3)/1 - Subtitles (srt) for Introduction_ Weighted Independent Sets in Path Graphs (8 min).srt 12KB
  327. 19 - XIX. LOCAL SEARCH ALGORITHMS (Week 6)/1 - Subtitles (srt) for The Maximum Cut Problem I (9 min).srt 12KB
  328. 7 - VII. CLUSTERING (Week 2)/1 - Subtitles (text) for Application to Clustering (12 min).txt 12KB
  329. 5 - V. PRIM'S MINIMUM SPANNING TREE ALGORITHM (Week 1)/1 - Subtitles (text) for MST Problem Definition (11 min).txt 12KB
  330. 14 - XIV. THE BELLMAN-FORD ALGORITHM (Week 4)/3 - Subtitles (srt) for The Basic Algorithm I (9 min).srt 12KB
  331. 17 - XVII. FASTER EXACT ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 5)/5 - Subtitles (text) for A Dynamic Programming Algorithm for TSP (12 min).txt 12KB
  332. 5 - V. PRIM'S MINIMUM SPANNING TREE ALGORITHM (Week 1)/2 - Subtitles (srt) for Prim's MST Algorithm (8 min).srt 12KB
  333. 5 - V. PRIM'S MINIMUM SPANNING TREE ALGORITHM (Week 1)/4 - Subtitles (srt) for Correctness Proof II (8 min).srt 12KB
  334. 1 - I. TWO MOTIVATING APPLICATIONS (Week 1)/1 - Subtitles (text) for Application_ Internet Routing (11 min).txt 12KB
  335. 19 - XIX. LOCAL SEARCH ALGORITHMS (Week 6)/4 - Subtitles (text) for Principles of Local Search II (10 min).txt 12KB
  336. 18 - XVIII. APPROXIMATION ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 6)/4 - Subtitles (text) for A Dynamic Programming Heuristic for Knapsack (12 min).txt 11KB
  337. 14 - XIV. THE BELLMAN-FORD ALGORITHM (Week 4)/1 - Subtitles (text) for Single-Source Shortest Paths, Revisted (11 min).txt 11KB
  338. 10 - X. INTRODUCTION TO DYNAMIC PROGRAMMING (Week 3)/5 - Subtitles (srt) for Principles of Dynamic Programming (8 min).srt 11KB
  339. 8 - VIII. ADVANCED UNION-FIND (Week 2)/6 - Subtitles (text) for Path Compression_ The Hopcroft-Ullman Analysis II [Advanced - Optional].txt 11KB
  340. 20 - XX. THE WIDER WORLD OF ALGORITHMS (Week 6)/3 - Subtitles (text) for Linear Programming and Beyond [Optional] (11 min).txt 11KB
  341. 4 - IV. A SCHEDULING APPLICATION (Week 1)/5 - Subtitles (srt) for Handling Ties [Advanced - Optional] (7 min).srt 11KB
  342. 3 - III. INTRODUCTION TO GREEDY ALGORITHMS (Week 1)/2 - Subtitles (text) for Application_ Optimal Caching (11 min).txt 11KB
  343. 16 - XVI. NP-COMPLETE PROBLEMS (Week 5)/4 - Subtitles (srt) for Definition and Interpretation of NP-Completeness II (8 min).srt 11KB
  344. 15 - XV. ALL-PAIRS SHORTEST PATHS (Week 4)/6 - Subtitles (text) for Johnson's Algorithm II (11 min).txt 11KB
  345. 17 - XVII. FASTER EXACT ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 5)/3 - Subtitles (srt) for Smarter Search for Vertex Cover II (8 min).srt 11KB
  346. 4 - IV. A SCHEDULING APPLICATION (Week 1)/3 - Subtitles (srt) for Correctness Proof - Part I (7 min).srt 11KB
  347. 14 - XIV. THE BELLMAN-FORD ALGORITHM (Week 4)/2 - Subtitles (text) for Optimal Substructure (11 min).txt 11KB
  348. 13 - XIII. OPTIMAL BINARY SEARCH TREES (Week 3)/4 - Subtitles (text) for A Dynamic Programming Algorithm I (10 min).txt 11KB
  349. 7 - VII. CLUSTERING (Week 2)/2 - Subtitles (text) for Correctness of Clustering Algorithm (10 min).txt 11KB
  350. 8 - VIII. ADVANCED UNION-FIND (Week 2)/1 - Subtitles (text) for Lazy Unions [Advanced - Optional] (10 min).txt 10KB
  351. 14 - XIV. THE BELLMAN-FORD ALGORITHM (Week 4)/4 - Subtitles (text) for The Basic Algorithm II (11 min).txt 10KB
  352. 14 - XIV. THE BELLMAN-FORD ALGORITHM (Week 4)/8 - Subtitles (srt) for Internet Routing II [Optional] (7 min).srt 10KB
  353. 16 - XVI. NP-COMPLETE PROBLEMS (Week 5)/3 - Subtitles (text) for Definition and Interpretation of NP-Completeness I (11 min).txt 10KB
  354. 15 - XV. ALL-PAIRS SHORTEST PATHS (Week 4)/5 - Subtitles (text) for Johnson's Algorithm I (11 min).txt 10KB
  355. 10 - X. INTRODUCTION TO DYNAMIC PROGRAMMING (Week 3)/4 - Subtitles (srt) for WIS in Path Graphs_ A Reconstruction Algorithm (7 min).srt 10KB
  356. 9 - IX. HUFFMAN CODES (Week 2)/4 - Subtitles (text) for Correctness Proof I (10 min).txt 10KB
  357. 6 - VI. KRUSKAL'S MINIMUM SPANNING TREE ALGORITHM (Week 2)/3 - Subtitles (text) for Implementing Kruskal's Algorithm via Union-Find I (9 min).txt 10KB
  358. 15 - XV. ALL-PAIRS SHORTEST PATHS (Week 4)/1 - Subtitles (srt) for Problem Definition (7 min).srt 10KB
  359. 13 - XIII. OPTIMAL BINARY SEARCH TREES (Week 3)/5 - Subtitles (text) for A Dynamic Programming Algorithm II (9 min).txt 10KB
  360. 9 - IX. HUFFMAN CODES (Week 2)/2 - Subtitles (text) for Problem Definition (10 min).txt 10KB
  361. 13 - XIII. OPTIMAL BINARY SEARCH TREES (Week 3)/2 - Subtitles (text) for Optimal Substructure (9 min).txt 10KB
  362. 18 - XVIII. APPROXIMATION ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 6)/5 - Subtitles (text) for Knapsack via Dynamic Programming, Revisited (10 min).txt 10KB
  363. 10 - X. INTRODUCTION TO DYNAMIC PROGRAMMING (Week 3)/3 - Subtitles (text) for WIS in Path Graphs_ A Linear-Time Algorithm (10 min).txt 10KB
  364. 18 - XVIII. APPROXIMATION ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 6)/3 - Subtitles (text) for Analysis of a Greedy Knapsack Heuristic II (10 min).txt 10KB
  365. 5 - V. PRIM'S MINIMUM SPANNING TREE ALGORITHM (Week 1)/7 - Subtitles (text) for Fast Implementation II (10 min).txt 10KB
  366. 19 - XIX. LOCAL SEARCH ALGORITHMS (Week 6)/2 - Subtitles (text) for The Maximum Cut Problem II (9 min).txt 10KB
  367. 6 - VI. KRUSKAL'S MINIMUM SPANNING TREE ALGORITHM (Week 2)/5 - Subtitles (text) for MSTs_ State-of-the-Art and Open Questions [Advanced - Optional] (9 min).txt 10KB
  368. 6 - VI. KRUSKAL'S MINIMUM SPANNING TREE ALGORITHM (Week 2)/2 - Subtitles (text) for Correctness of Kruskal's Algorithm (9 min).txt 10KB
  369. 11 - XI. THE KNAPSACK PROBLEM (Week 3)/2 - Subtitles (text) for A Dynamic Programming Algorithm (10 min).txt 10KB
  370. 18 - XVIII. APPROXIMATION ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 6)/2 - Subtitles (srt) for Analysis of a Greedy Knapsack Heuristic I (7 min).srt 9KB
  371. 19 - XIX. LOCAL SEARCH ALGORITHMS (Week 6)/3 - Subtitles (text) for Principles of Local Search I (9 min).txt 9KB
  372. 11 - XI. THE KNAPSACK PROBLEM (Week 3)/1 - Subtitles (text) for The Knapsack Problem (10 min).txt 9KB
  373. 14 - XIV. THE BELLMAN-FORD ALGORITHM (Week 4)/5 - Subtitles (text) for Detecting Negative Cycles (9 min).txt 9KB
  374. 9 - IX. HUFFMAN CODES (Week 2)/1 - Subtitles (text) for Introduction and Motivation (9 min).txt 9KB
  375. 4 - IV. A SCHEDULING APPLICATION (Week 1)/1 - Subtitles (srt) for Problem Definition (6 min).srt 9KB
  376. 17 - XVII. FASTER EXACT ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 5)/2 - Subtitles (text) for Smarter Search for Vertex Cover I (10 min).txt 9KB
  377. 8 - VIII. ADVANCED UNION-FIND (Week 2)/5 - Subtitles (text) for Path Compression_ The Hopcroft-Ullman Analysis I [Advanced - Optional].txt 9KB
  378. 13 - XIII. OPTIMAL BINARY SEARCH TREES (Week 3)/3 - Subtitles (srt) for Proof of Optimal Substructure (7 min).srt 9KB
  379. 10 - X. INTRODUCTION TO DYNAMIC PROGRAMMING (Week 3)/2 - Subtitles (text) for WIS in Path Graphs_ Optimal Substructure (9 min).txt 9KB
  380. 17 - XVII. FASTER EXACT ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 5)/1 - Subtitles (text) for The Vertex Cover Problem (9 min).txt 9KB
  381. 1 - I. TWO MOTIVATING APPLICATIONS (Week 1)/2 - Subtitles (text) for Application_ Sequence Alignment (9 min).txt 9KB
  382. 16 - XVI. NP-COMPLETE PROBLEMS (Week 5)/5 - Subtitles (text) for The P vs. NP Question (9 min).txt 9KB
  383. 6 - VI. KRUSKAL'S MINIMUM SPANNING TREE ALGORITHM (Week 2)/1 - Subtitles (text) for Kruskal's MST Algorithm (8 min).txt 9KB
  384. 10 - X. INTRODUCTION TO DYNAMIC PROGRAMMING (Week 3)/1 - Subtitles (text) for Introduction_ Weighted Independent Sets in Path Graphs (8 min).txt 8KB
  385. 19 - XIX. LOCAL SEARCH ALGORITHMS (Week 6)/1 - Subtitles (text) for The Maximum Cut Problem I (9 min).txt 8KB
  386. 14 - XIV. THE BELLMAN-FORD ALGORITHM (Week 4)/3 - Subtitles (text) for The Basic Algorithm I (9 min).txt 8KB
  387. 5 - V. PRIM'S MINIMUM SPANNING TREE ALGORITHM (Week 1)/2 - Subtitles (text) for Prim's MST Algorithm (8 min).txt 8KB
  388. 5 - V. PRIM'S MINIMUM SPANNING TREE ALGORITHM (Week 1)/4 - Subtitles (text) for Correctness Proof II (8 min).txt 8KB
  389. 10 - X. INTRODUCTION TO DYNAMIC PROGRAMMING (Week 3)/5 - Subtitles (text) for Principles of Dynamic Programming (8 min).txt 8KB
  390. 4 - IV. A SCHEDULING APPLICATION (Week 1)/5 - Subtitles (text) for Handling Ties [Advanced - Optional] (7 min).txt 8KB
  391. 16 - XVI. NP-COMPLETE PROBLEMS (Week 5)/4 - Subtitles (text) for Definition and Interpretation of NP-Completeness II (8 min).txt 8KB
  392. 4 - IV. A SCHEDULING APPLICATION (Week 1)/3 - Subtitles (text) for Correctness Proof - Part I (7 min).txt 8KB
  393. 17 - XVII. FASTER EXACT ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 5)/3 - Subtitles (text) for Smarter Search for Vertex Cover II (8 min).txt 8KB
  394. 14 - XIV. THE BELLMAN-FORD ALGORITHM (Week 4)/8 - Subtitles (text) for Internet Routing II [Optional] (7 min).txt 7KB
  395. 10 - X. INTRODUCTION TO DYNAMIC PROGRAMMING (Week 3)/4 - Subtitles (text) for WIS in Path Graphs_ A Reconstruction Algorithm (7 min).txt 7KB
  396. 15 - XV. ALL-PAIRS SHORTEST PATHS (Week 4)/1 - Subtitles (text) for Problem Definition (7 min).txt 7KB
  397. 2 - II. SELECTED REVIEW FROM PART I (Week 1)/8 - Subtitles (srt) for Data Structures_ Overview [Part I Review - Optional] (5).srt 7KB
  398. 18 - XVIII. APPROXIMATION ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 6)/2 - Subtitles (text) for Analysis of a Greedy Knapsack Heuristic I (7 min).txt 7KB
  399. 4 - IV. A SCHEDULING APPLICATION (Week 1)/1 - Subtitles (text) for Problem Definition (6 min).txt 7KB
  400. 4 - IV. A SCHEDULING APPLICATION (Week 1)/4 - Subtitles (srt) for Correctness Proof - Part II (5 min).srt 6KB
  401. 13 - XIII. OPTIMAL BINARY SEARCH TREES (Week 3)/3 - Subtitles (text) for Proof of Optimal Substructure (7 min).txt 6KB
  402. 2 - II. SELECTED REVIEW FROM PART I (Week 1)/4 - Subtitles (srt) for Big-Oh Notation [Part I Review - Optional] (4 min).srt 6KB
  403. 2 - II. SELECTED REVIEW FROM PART I (Week 1)/8 - Subtitles (text) for Data Structures_ Overview [Part I Review - Optional] (5).txt 5KB
  404. 4 - IV. A SCHEDULING APPLICATION (Week 1)/4 - Subtitles (text) for Correctness Proof - Part II (5 min).txt 5KB
  405. 2 - II. SELECTED REVIEW FROM PART I (Week 1)/4 - Subtitles (text) for Big-Oh Notation [Part I Review - Optional] (4 min).txt 4KB
  406. 20 - XX. THE WIDER WORLD OF ALGORITHMS (Week 6)/4 - Subtitles (srt) for Epilogue (1 min).srt 2KB
  407. 20 - XX. THE WIDER WORLD OF ALGORITHMS (Week 6)/4 - Subtitles (text) for Epilogue (1 min).txt 1KB