Download link
File List
-
9 - IX. HUFFMAN CODES (Week 2)/3 - Video (MP4) for A Greedy Algorithm (17 min).mp4 24.7 MB
2 - II. SELECTED REVIEW FROM PART I (Week 1)/6 - Video (MP4) for Graph Search - Overview [Part I Review - Optional] (23 min).mp4 24.36 MB
8 - VIII. ADVANCED UNION-FIND (Week 2)/7 - Video (MP4) for The Ackermann Function [Advanced - Optional](17 min).mp4 22.64 MB
20 - XX. THE WIDER WORLD OF ALGORITHMS (Week 6)/1 - Video (MP4) for Stable Matching [Optional] (15 min).mp4 22.55 MB
8 - VIII. ADVANCED UNION-FIND (Week 2)/3 - Video (MP4) for Analysis of Union-by-Rank [Advanced - Optional](15).mp4 22.29 MB
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 21.92 MB
19 - XIX. LOCAL SEARCH ALGORITHMS (Week 6)/7 - Video (MP4) for Analysis of Papadimitriou's Algorithm (15 min).mp4 21.8 MB
8 - VIII. ADVANCED UNION-FIND (Week 2)/4 - Video (MP4) for Path Compression [Advanced - Optional] (15).mp4 21.51 MB
19 - XIX. LOCAL SEARCH ALGORITHMS (Week 6)/6 - Video (MP4) for Random Walks on a Line (16 min).mp4 21.33 MB
17 - XVII. FASTER EXACT ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 5)/4 - Video (MP4) for The Traveling Salesman Problem (15 min).mp4 21 MB
20 - XX. THE WIDER WORLD OF ALGORITHMS (Week 6)/2 - Video (MP4) for Matchings, Flows, and Braess's Paradox [Optional] (14 min).mp4 20.96 MB
8 - VIII. ADVANCED UNION-FIND (Week 2)/8 - Video (MP4) for Path Compression_ Tarjan's Analysis I [Advanced - Optional].mp4 20.78 MB
16 - XVI. NP-COMPLETE PROBLEMS (Week 5)/1 - Video (MP4) for Polynomial-Time Solvable Problems (14 min).mp4 20.49 MB
2 - II. SELECTED REVIEW FROM PART I (Week 1)/2 - Video (MP4) for Why Study Algorithms_ [Part I Review - Optional] (19 min).mp4 20.25 MB
16 - XVI. NP-COMPLETE PROBLEMS (Week 5)/2 - Video (MP4) for Reductions and Completeness (14 min).mp4 19.86 MB
16 - XVI. NP-COMPLETE PROBLEMS (Week 5)/6 - Video (MP4) for Algorithmic Approaches to NP-Complete Problems (13 min).mp4 19.86 MB
5 - V. PRIM'S MINIMUM SPANNING TREE ALGORITHM (Week 1)/6 - Video (MP4) for Fast Implementation I (15 min).mp4 19.66 MB
19 - XIX. LOCAL SEARCH ALGORITHMS (Week 6)/5 - Video (MP4) for The 2-SAT Problem (15 min).mp4 19.64 MB
15 - XV. ALL-PAIRS SHORTEST PATHS (Week 4)/4 - Video (MP4) for A Reweighting Technique (14 min).mp4 19.62 MB
12 - XII. SEQUENCE ALIGNMENT (Week 3)/1 - Video (MP4) for Optimal Substructure (14 min).mp4 19.54 MB
2 - II. SELECTED REVIEW FROM PART I (Week 1)/9 - Video (MP4) for Heaps_ Operations and Applications [Part I Review - Optional] (18).mp4 19.49 MB
8 - VIII. ADVANCED UNION-FIND (Week 2)/9 - Video (MP4) for Path Compression_ Tarjan's Analysis II [Advanced - Optional].mp4 19.09 MB
5 - V. PRIM'S MINIMUM SPANNING TREE ALGORITHM (Week 1)/3 - Video (MP4) for Correctness Proof I (16 min).mp4 19.02 MB
15 - XV. ALL-PAIRS SHORTEST PATHS (Week 4)/3 - Video (MP4) for The Floyd-Warshall Algorithm (13 min).mp4 18.89 MB
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 18.88 MB
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 18.86 MB
18 - XVIII. APPROXIMATION ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 6)/6 - Video (MP4) for Ananysis of Dynamic Programming Heuristic (15 min).mp4 18.78 MB
18 - XVIII. APPROXIMATION ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 6)/1 - Video (MP4) for A Greedy Knapsack Heuristic (14 min).mp4 18.74 MB
14 - XIV. THE BELLMAN-FORD ALGORITHM (Week 4)/6 - Video (MP4) for A Space Optimization (12 min).mp4 18.34 MB
2 - II. SELECTED REVIEW FROM PART I (Week 1)/1 - Video (MP4) for About the Course [Part I Review - Optional] (17 min).mp4 18.33 MB
8 - VIII. ADVANCED UNION-FIND (Week 2)/2 - Video (MP4) for Union-by-Rank [Advanced - Optional] (12 min).mp4 18.19 MB
3 - III. INTRODUCTION TO GREEDY ALGORITHMS (Week 1)/1 - Video (MP4) for Introduction to Greedy Algorithms (13 min).mp4 18.04 MB
17 - XVII. FASTER EXACT ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 5)/5 - Video (MP4) for A Dynamic Programming Algorithm for TSP (12 min).mp4 17.45 MB
13 - XIII. OPTIMAL BINARY SEARCH TREES (Week 3)/1 - Video (MP4) for Problem Definition (12 min).mp4 17.19 MB
8 - VIII. ADVANCED UNION-FIND (Week 2)/6 - Video (MP4) for Path Compression_ The Hopcroft-Ullman Analysis II [Advanced - Optional].mp4 17.17 MB
4 - IV. A SCHEDULING APPLICATION (Week 1)/2 - Video (MP4) for A Greedy Algorithm (13 min).mp4 17.16 MB
15 - XV. ALL-PAIRS SHORTEST PATHS (Week 4)/6 - Video (MP4) for Johnson's Algorithm II (11 min).mp4 16.86 MB
20 - XX. THE WIDER WORLD OF ALGORITHMS (Week 6)/3 - Video (MP4) for Linear Programming and Beyond [Optional] (11 min).mp4 16.84 MB
9 - IX. HUFFMAN CODES (Week 2)/5 - Video (MP4) for Correctness Proof II (13 min).mp4 16.75 MB
14 - XIV. THE BELLMAN-FORD ALGORITHM (Week 4)/7 - Video (MP4) for Internet Routing I [Optional] (11 min).mp4 16.72 MB
12 - XII. SEQUENCE ALIGNMENT (Week 3)/2 - Video (MP4) for A Dynamic Programming Algorithm (12 min).mp4 16.71 MB
15 - XV. ALL-PAIRS SHORTEST PATHS (Week 4)/2 - Video (MP4) for Optimal Substructure (12 min).mp4 16.53 MB
16 - XVI. NP-COMPLETE PROBLEMS (Week 5)/3 - Video (MP4) for Definition and Interpretation of NP-Completeness I (11 min).mp4 16.35 MB
15 - XV. ALL-PAIRS SHORTEST PATHS (Week 4)/5 - Video (MP4) for Johnson's Algorithm I (11 min).mp4 15.49 MB
18 - XVIII. APPROXIMATION ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 6)/4 - Video (MP4) for A Dynamic Programming Heuristic for Knapsack (12 min).mp4 15.4 MB
9 - IX. HUFFMAN CODES (Week 2)/2 - Video (MP4) for Problem Definition (10 min).mp4 15.35 MB
14 - XIV. THE BELLMAN-FORD ALGORITHM (Week 4)/2 - Video (MP4) for Optimal Substructure (11 min).mp4 15.27 MB
8 - VIII. ADVANCED UNION-FIND (Week 2)/1 - Video (MP4) for Lazy Unions [Advanced - Optional] (10 min).mp4 15.24 MB
14 - XIV. THE BELLMAN-FORD ALGORITHM (Week 4)/1 - Video (MP4) for Single-Source Shortest Paths, Revisted (11 min).mp4 15.15 MB
7 - VII. CLUSTERING (Week 2)/1 - Video (MP4) for Application to Clustering (12 min).mp4 15.13 MB
5 - V. PRIM'S MINIMUM SPANNING TREE ALGORITHM (Week 1)/1 - Video (MP4) for MST Problem Definition (11 min).mp4 15 MB
5 - V. PRIM'S MINIMUM SPANNING TREE ALGORITHM (Week 1)/5 - Video (MP4) for Proof of Cut Property [Advanced - Optional] (12 min).mp4 14.99 MB
3 - III. INTRODUCTION TO GREEDY ALGORITHMS (Week 1)/2 - Video (MP4) for Application_ Optimal Caching (11 min).mp4 14.97 MB
10 - X. INTRODUCTION TO DYNAMIC PROGRAMMING (Week 3)/3 - Video (MP4) for WIS in Path Graphs_ A Linear-Time Algorithm (10 min).mp4 14.54 MB
19 - XIX. LOCAL SEARCH ALGORITHMS (Week 6)/4 - Video (MP4) for Principles of Local Search II (10 min).mp4 14.49 MB
2 - II. SELECTED REVIEW FROM PART I (Week 1)/5 - Video (MP4) for Graph Representations [Part I Review - Optional] (14 min).mp4 14.48 MB
16 - XVI. NP-COMPLETE PROBLEMS (Week 5)/5 - Video (MP4) for The P vs. NP Question (9 min).mp4 14.28 MB
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 14.23 MB
17 - XVII. FASTER EXACT ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 5)/2 - Video (MP4) for Smarter Search for Vertex Cover I (10 min).mp4 14.14 MB
11 - XI. THE KNAPSACK PROBLEM (Week 3)/1 - Video (MP4) for The Knapsack Problem (10 min).mp4 14.08 MB
13 - XIII. OPTIMAL BINARY SEARCH TREES (Week 3)/4 - Video (MP4) for A Dynamic Programming Algorithm I (10 min).mp4 14.05 MB
13 - XIII. OPTIMAL BINARY SEARCH TREES (Week 3)/2 - Video (MP4) for Optimal Substructure (9 min).mp4 13.94 MB
1 - I. TWO MOTIVATING APPLICATIONS (Week 1)/1 - Video (MP4) for Application_ Internet Routing (11 min).mp4 13.85 MB
8 - VIII. ADVANCED UNION-FIND (Week 2)/5 - Video (MP4) for Path Compression_ The Hopcroft-Ullman Analysis I [Advanced - Optional].mp4 13.66 MB
11 - XI. THE KNAPSACK PROBLEM (Week 3)/2 - Video (MP4) for A Dynamic Programming Algorithm (10 min).mp4 13.61 MB
14 - XIV. THE BELLMAN-FORD ALGORITHM (Week 4)/4 - Video (MP4) for The Basic Algorithm II (11 min).mp4 13.61 MB
10 - X. INTRODUCTION TO DYNAMIC PROGRAMMING (Week 3)/2 - Video (MP4) for WIS in Path Graphs_ Optimal Substructure (9 min).mp4 13.52 MB
9 - IX. HUFFMAN CODES (Week 2)/4 - Video (MP4) for Correctness Proof I (10 min).mp4 13.3 MB
18 - XVIII. APPROXIMATION ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 6)/5 - Video (MP4) for Knapsack via Dynamic Programming, Revisited (10 min).mp4 13.22 MB
5 - V. PRIM'S MINIMUM SPANNING TREE ALGORITHM (Week 1)/7 - Video (MP4) for Fast Implementation II (10 min).mp4 13.17 MB
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 12.9 MB
19 - XIX. LOCAL SEARCH ALGORITHMS (Week 6)/2 - Video (MP4) for The Maximum Cut Problem II (9 min).mp4 12.84 MB
14 - XIV. THE BELLMAN-FORD ALGORITHM (Week 4)/5 - Video (MP4) for Detecting Negative Cycles (9 min).mp4 12.78 MB
17 - XVII. FASTER EXACT ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 5)/1 - Video (MP4) for The Vertex Cover Problem (9 min).mp4 12.75 MB
19 - XIX. LOCAL SEARCH ALGORITHMS (Week 6)/1 - Video (MP4) for The Maximum Cut Problem I (9 min).mp4 12.41 MB
18 - XVIII. APPROXIMATION ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 6)/3 - Video (MP4) for Analysis of a Greedy Knapsack Heuristic II (10 min).mp4 12.4 MB
6 - VI. KRUSKAL'S MINIMUM SPANNING TREE ALGORITHM (Week 2)/2 - Video (MP4) for Correctness of Kruskal's Algorithm (9 min).mp4 12.3 MB
10 - X. INTRODUCTION TO DYNAMIC PROGRAMMING (Week 3)/5 - Video (MP4) for Principles of Dynamic Programming (8 min).mp4 12.27 MB
19 - XIX. LOCAL SEARCH ALGORITHMS (Week 6)/3 - Video (MP4) for Principles of Local Search I (9 min).mp4 12.22 MB
16 - XVI. NP-COMPLETE PROBLEMS (Week 5)/4 - Video (MP4) for Definition and Interpretation of NP-Completeness II (8 min).mp4 12.18 MB
14 - XIV. THE BELLMAN-FORD ALGORITHM (Week 4)/3 - Video (MP4) for The Basic Algorithm I (9 min).mp4 12.11 MB
13 - XIII. OPTIMAL BINARY SEARCH TREES (Week 3)/5 - Video (MP4) for A Dynamic Programming Algorithm II (9 min).mp4 11.94 MB
7 - VII. CLUSTERING (Week 2)/2 - Video (MP4) for Correctness of Clustering Algorithm (10 min).mp4 11.93 MB
9 - IX. HUFFMAN CODES (Week 2)/1 - Video (MP4) for Introduction and Motivation (9 min).mp4 11.89 MB
10 - X. INTRODUCTION TO DYNAMIC PROGRAMMING (Week 3)/1 - Video (MP4) for Introduction_ Weighted Independent Sets in Path Graphs (8 min).mp4 11.26 MB
1 - I. TWO MOTIVATING APPLICATIONS (Week 1)/2 - Video (MP4) for Application_ Sequence Alignment (9 min).mp4 11.1 MB
6 - VI. KRUSKAL'S MINIMUM SPANNING TREE ALGORITHM (Week 2)/1 - Video (MP4) for Kruskal's MST Algorithm (8 min).mp4 11.02 MB
14 - XIV. THE BELLMAN-FORD ALGORITHM (Week 4)/8 - Video (MP4) for Internet Routing II [Optional] (7 min).mp4 10.68 MB
17 - XVII. FASTER EXACT ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 5)/3 - Video (MP4) for Smarter Search for Vertex Cover II (8 min).mp4 10.37 MB
5 - V. PRIM'S MINIMUM SPANNING TREE ALGORITHM (Week 1)/4 - Video (MP4) for Correctness Proof II (8 min).mp4 10.14 MB
5 - V. PRIM'S MINIMUM SPANNING TREE ALGORITHM (Week 1)/2 - Video (MP4) for Prim's MST Algorithm (8 min).mp4 9.99 MB
13 - XIII. OPTIMAL BINARY SEARCH TREES (Week 3)/3 - Video (MP4) for Proof of Optimal Substructure (7 min).mp4 9.86 MB
4 - IV. A SCHEDULING APPLICATION (Week 1)/5 - Video (MP4) for Handling Ties [Advanced - Optional] (7 min).mp4 9.65 MB
10 - X. INTRODUCTION TO DYNAMIC PROGRAMMING (Week 3)/4 - Video (MP4) for WIS in Path Graphs_ A Reconstruction Algorithm (7 min).mp4 9.62 MB
15 - XV. ALL-PAIRS SHORTEST PATHS (Week 4)/1 - Video (MP4) for Problem Definition (7 min).mp4 9.48 MB
4 - IV. A SCHEDULING APPLICATION (Week 1)/3 - Video (MP4) for Correctness Proof - Part I (7 min).mp4 9.22 MB
18 - XVIII. APPROXIMATION ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 6)/2 - Video (MP4) for Analysis of a Greedy Knapsack Heuristic I (7 min).mp4 8.93 MB
4 - IV. A SCHEDULING APPLICATION (Week 1)/1 - Video (MP4) for Problem Definition (6 min).mp4 7.79 MB
4 - IV. A SCHEDULING APPLICATION (Week 1)/4 - Video (MP4) for Correctness Proof - Part II (5 min).mp4 6.22 MB
20 - XX. THE WIDER WORLD OF ALGORITHMS (Week 6)/3 - Slides (PDF) for Linear Programming and Beyond [Optional] (11 min).pdf 5.15 MB
20 - XX. THE WIDER WORLD OF ALGORITHMS (Week 6)/2 - Slides (PDF) for Matchings, Flows, and Braess's Paradox [Optional] (14 min).pdf 5.15 MB
20 - XX. THE WIDER WORLD OF ALGORITHMS (Week 6)/1 - Slides (PDF) for Stable Matching [Optional] (15 min).pdf 5.15 MB
2 - II. SELECTED REVIEW FROM PART I (Week 1)/8 - Video (MP4) for Data Structures_ Overview [Part I Review - Optional] (5).mp4 4.89 MB
2 - II. SELECTED REVIEW FROM PART I (Week 1)/4 - Video (MP4) for Big-Oh Notation [Part I Review - Optional] (4 min).mp4 4.36 MB
9 - IX. HUFFMAN CODES (Week 2)/5 - Slides (PDF) for Correctness Proof II (13 min).pdf 3.48 MB
9 - IX. HUFFMAN CODES (Week 2)/4 - Slides (PDF) for Correctness Proof I (10 min).pdf 3.48 MB
8 - VIII. ADVANCED UNION-FIND (Week 2)/8 - Slides (PDF) for Path Compression_ Tarjan's Analysis I [Advanced - Optional].pdf 3.43 MB
8 - VIII. ADVANCED UNION-FIND (Week 2)/9 - Slides (PDF) for Path Compression_ Tarjan's Analysis II [Advanced - Optional].pdf 3.43 MB
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 3.41 MB
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 3.41 MB
5 - V. PRIM'S MINIMUM SPANNING TREE ALGORITHM (Week 1)/6 - Slides (PDF) for Fast Implementation I (15 min).pdf 3.3 MB
5 - V. PRIM'S MINIMUM SPANNING TREE ALGORITHM (Week 1)/7 - Slides (PDF) for Fast Implementation II (10 min).pdf 3.3 MB
13 - XIII. OPTIMAL BINARY SEARCH TREES (Week 3)/3 - Slides (PDF) for Proof of Optimal Substructure (7 min).pdf 3.29 MB
13 - XIII. OPTIMAL BINARY SEARCH TREES (Week 3)/2 - Slides (PDF) for Optimal Substructure (9 min).pdf 3.29 MB
19 - XIX. LOCAL SEARCH ALGORITHMS (Week 6)/1 - Slides (PDF) for The Maximum Cut Problem I (9 min).pdf 3.06 MB
19 - XIX. LOCAL SEARCH ALGORITHMS (Week 6)/2 - Slides (PDF) for The Maximum Cut Problem II (9 min).pdf 3.06 MB
15 - XV. ALL-PAIRS SHORTEST PATHS (Week 4)/6 - Slides (PDF) for Johnson's Algorithm II (11 min).pdf 3.04 MB
15 - XV. ALL-PAIRS SHORTEST PATHS (Week 4)/5 - Slides (PDF) for Johnson's Algorithm I (11 min).pdf 3.04 MB
8 - VIII. ADVANCED UNION-FIND (Week 2)/6 - Slides (PDF) for Path Compression_ The Hopcroft-Ullman Analysis II [Advanced - Optional].pdf 3.01 MB
8 - VIII. ADVANCED UNION-FIND (Week 2)/5 - Slides (PDF) for Path Compression_ The Hopcroft-Ullman Analysis I [Advanced - Optional].pdf 3.01 MB
17 - XVII. FASTER EXACT ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 5)/4 - Slides (PDF) for The Traveling Salesman Problem (15 min).pdf 2.94 MB
13 - XIII. OPTIMAL BINARY SEARCH TREES (Week 3)/5 - Slides (PDF) for A Dynamic Programming Algorithm II (9 min).pdf 2.84 MB
13 - XIII. OPTIMAL BINARY SEARCH TREES (Week 3)/4 - Slides (PDF) for A Dynamic Programming Algorithm I (10 min).pdf 2.84 MB
18 - XVIII. APPROXIMATION ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 6)/2 - Slides (PDF) for Analysis of a Greedy Knapsack Heuristic I (7 min).pdf 2.72 MB
18 - XVIII. APPROXIMATION ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 6)/3 - Slides (PDF) for Analysis of a Greedy Knapsack Heuristic II (10 min).pdf 2.72 MB
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 2.69 MB
17 - XVII. FASTER EXACT ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 5)/2 - Slides (PDF) for Smarter Search for Vertex Cover I (10 min).pdf 2.69 MB
17 - XVII. FASTER EXACT ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 5)/3 - Slides (PDF) for Smarter Search for Vertex Cover II (8 min).pdf 2.69 MB
9 - IX. HUFFMAN CODES (Week 2)/3 - Slides (PDF) for A Greedy Algorithm (17 min).pdf 2.68 MB
19 - XIX. LOCAL SEARCH ALGORITHMS (Week 6)/3 - Slides (PDF) for Principles of Local Search I (9 min).pdf 2.66 MB
19 - XIX. LOCAL SEARCH ALGORITHMS (Week 6)/4 - Slides (PDF) for Principles of Local Search II (10 min).pdf 2.66 MB
8 - VIII. ADVANCED UNION-FIND (Week 2)/3 - Slides (PDF) for Analysis of Union-by-Rank [Advanced - Optional](15).pdf 2.66 MB
19 - XIX. LOCAL SEARCH ALGORITHMS (Week 6)/7 - Slides (PDF) for Analysis of Papadimitriou's Algorithm (15 min).pdf 2.47 MB
8 - VIII. ADVANCED UNION-FIND (Week 2)/7 - Slides (PDF) for The Ackermann Function [Advanced - Optional](17 min).pdf 2.46 MB
5 - V. PRIM'S MINIMUM SPANNING TREE ALGORITHM (Week 1)/3 - Slides (PDF) for Correctness Proof I (16 min).pdf 2.46 MB
15 - XV. ALL-PAIRS SHORTEST PATHS (Week 4)/4 - Slides (PDF) for A Reweighting Technique (14 min).pdf 2.43 MB
12 - XII. SEQUENCE ALIGNMENT (Week 3)/1 - Slides (PDF) for Optimal Substructure (14 min).pdf 2.36 MB
14 - XIV. THE BELLMAN-FORD ALGORITHM (Week 4)/4 - Slides (PDF) for The Basic Algorithm II (11 min).pdf 2.3 MB
14 - XIV. THE BELLMAN-FORD ALGORITHM (Week 4)/3 - Slides (PDF) for The Basic Algorithm I (9 min).pdf 2.3 MB
2 - II. SELECTED REVIEW FROM PART I (Week 1)/6 - Slides (PDF) for Graph Search - Overview [Part I Review - Optional] (23 min).pdf 2.29 MB
19 - XIX. LOCAL SEARCH ALGORITHMS (Week 6)/6 - Slides (PDF) for Random Walks on a Line (16 min).pdf 2.27 MB
12 - XII. SEQUENCE ALIGNMENT (Week 3)/2 - Slides (PDF) for A Dynamic Programming Algorithm (12 min).pdf 2.25 MB
16 - XVI. NP-COMPLETE PROBLEMS (Week 5)/3 - Slides (PDF) for Definition and Interpretation of NP-Completeness I (11 min).pdf 2.21 MB
16 - XVI. NP-COMPLETE PROBLEMS (Week 5)/4 - Slides (PDF) for Definition and Interpretation of NP-Completeness II (8 min).pdf 2.21 MB
14 - XIV. THE BELLMAN-FORD ALGORITHM (Week 4)/6 - Slides (PDF) for A Space Optimization (12 min).pdf 2.18 MB
5 - V. PRIM'S MINIMUM SPANNING TREE ALGORITHM (Week 1)/5 - Slides (PDF) for Proof of Cut Property [Advanced - Optional] (12 min).pdf 2.15 MB
8 - VIII. ADVANCED UNION-FIND (Week 2)/2 - Slides (PDF) for Union-by-Rank [Advanced - Optional] (12 min).pdf 2.12 MB
2 - II. SELECTED REVIEW FROM PART I (Week 1)/9 - Slides (PDF) for Heaps_ Operations and Applications [Part I Review - Optional] (18).pdf 2.11 MB
1 - I. TWO MOTIVATING APPLICATIONS (Week 1)/2 - Slides (PDF) for Application_ Sequence Alignment (9 min).pdf 2.11 MB
17 - XVII. FASTER EXACT ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 5)/5 - Slides (PDF) for A Dynamic Programming Algorithm for TSP (12 min).pdf 2.09 MB
18 - XVIII. APPROXIMATION ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 6)/1 - Slides (PDF) for A Greedy Knapsack Heuristic (14 min).pdf 2.06 MB
18 - XVIII. APPROXIMATION ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 6)/6 - Slides (PDF) for Ananysis of Dynamic Programming Heuristic (15 min).pdf 2.06 MB
8 - VIII. ADVANCED UNION-FIND (Week 2)/4 - Slides (PDF) for Path Compression [Advanced - Optional] (15).pdf 1.99 MB
14 - XIV. THE BELLMAN-FORD ALGORITHM (Week 4)/2 - Slides (PDF) for Optimal Substructure (11 min).pdf 1.95 MB
13 - XIII. OPTIMAL BINARY SEARCH TREES (Week 3)/1 - Slides (PDF) for Problem Definition (12 min).pdf 1.94 MB
9 - IX. HUFFMAN CODES (Week 2)/2 - Slides (PDF) for Problem Definition (10 min).pdf 1.89 MB
15 - XV. ALL-PAIRS SHORTEST PATHS (Week 4)/3 - Slides (PDF) for The Floyd-Warshall Algorithm (13 min).pdf 1.87 MB
15 - XV. ALL-PAIRS SHORTEST PATHS (Week 4)/2 - Slides (PDF) for Optimal Substructure (12 min).pdf 1.87 MB
16 - XVI. NP-COMPLETE PROBLEMS (Week 5)/1 - Slides (PDF) for Polynomial-Time Solvable Problems (14 min).pdf 1.86 MB
14 - XIV. THE BELLMAN-FORD ALGORITHM (Week 4)/1 - Slides (PDF) for Single-Source Shortest Paths, Revisted (11 min).pdf 1.82 MB
2 - II. SELECTED REVIEW FROM PART I (Week 1)/5 - Slides (PDF) for Graph Representations [Part I Review - Optional] (14 min).pdf 1.79 MB
7 - VII. CLUSTERING (Week 2)/1 - Slides (PDF) for Application to Clustering (12 min).pdf 1.79 MB
20 - XX. THE WIDER WORLD OF ALGORITHMS (Week 6)/4 - Video (MP4) for Epilogue (1 min).mp4 1.79 MB
16 - XVI. NP-COMPLETE PROBLEMS (Week 5)/2 - Slides (PDF) for Reductions and Completeness (14 min).pdf 1.75 MB
3 - III. INTRODUCTION TO GREEDY ALGORITHMS (Week 1)/1 - Slides (PDF) for Introduction to Greedy Algorithms (13 min).pdf 1.75 MB
19 - XIX. LOCAL SEARCH ALGORITHMS (Week 6)/5 - Slides (PDF) for The 2-SAT Problem (15 min).pdf 1.72 MB
14 - XIV. THE BELLMAN-FORD ALGORITHM (Week 4)/7 - Slides (PDF) for Internet Routing I [Optional] (11 min).pdf 1.69 MB
14 - XIV. THE BELLMAN-FORD ALGORITHM (Week 4)/8 - Slides (PDF) for Internet Routing II [Optional] (7 min).pdf 1.69 MB
10 - X. INTRODUCTION TO DYNAMIC PROGRAMMING (Week 3)/2 - Slides (PDF) for WIS in Path Graphs_ Optimal Substructure (9 min).pdf 1.67 MB
18 - XVIII. APPROXIMATION ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 6)/4 - Slides (PDF) for A Dynamic Programming Heuristic for Knapsack (12 min).pdf 1.66 MB
9 - IX. HUFFMAN CODES (Week 2)/1 - Slides (PDF) for Introduction and Motivation (9 min).pdf 1.66 MB
8 - VIII. ADVANCED UNION-FIND (Week 2)/1 - Slides (PDF) for Lazy Unions [Advanced - Optional] (10 min).pdf 1.64 MB
4 - IV. A SCHEDULING APPLICATION (Week 1)/2 - Slides (PDF) for A Greedy Algorithm (13 min).pdf 1.63 MB
7 - VII. CLUSTERING (Week 2)/2 - Slides (PDF) for Correctness of Clustering Algorithm (10 min).pdf 1.62 MB
5 - V. PRIM'S MINIMUM SPANNING TREE ALGORITHM (Week 1)/1 - Slides (PDF) for MST Problem Definition (11 min).pdf 1.61 MB
10 - X. INTRODUCTION TO DYNAMIC PROGRAMMING (Week 3)/3 - Slides (PDF) for WIS in Path Graphs_ A Linear-Time Algorithm (10 min).pdf 1.6 MB
6 - VI. KRUSKAL'S MINIMUM SPANNING TREE ALGORITHM (Week 2)/2 - Slides (PDF) for Correctness of Kruskal's Algorithm (9 min).pdf 1.56 MB
11 - XI. THE KNAPSACK PROBLEM (Week 3)/1 - Slides (PDF) for The Knapsack Problem (10 min).pdf 1.48 MB
18 - XVIII. APPROXIMATION ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 6)/5 - Slides (PDF) for Knapsack via Dynamic Programming, Revisited (10 min).pdf 1.44 MB
11 - XI. THE KNAPSACK PROBLEM (Week 3)/2 - Slides (PDF) for A Dynamic Programming Algorithm (10 min).pdf 1.42 MB
1 - I. TWO MOTIVATING APPLICATIONS (Week 1)/1 - Slides (PDF) for Application_ Internet Routing (11 min).pdf 1.41 MB
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 1.41 MB
4 - IV. A SCHEDULING APPLICATION (Week 1)/5 - Slides (PDF) for Handling Ties [Advanced - Optional] (7 min).pdf 1.34 MB
4 - IV. A SCHEDULING APPLICATION (Week 1)/3 - Slides (PDF) for Correctness Proof - Part I (7 min).pdf 1.33 MB
16 - XVI. NP-COMPLETE PROBLEMS (Week 5)/5 - Slides (PDF) for The P vs. NP Question (9 min).pdf 1.27 MB
2 - II. SELECTED REVIEW FROM PART I (Week 1)/2 - Slides (PDF) for Why Study Algorithms_ [Part I Review - Optional] (19 min).pdf 1.23 MB
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 1.2 MB
14 - XIV. THE BELLMAN-FORD ALGORITHM (Week 4)/5 - Slides (PDF) for Detecting Negative Cycles (9 min).pdf 1.2 MB
17 - XVII. FASTER EXACT ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 5)/1 - Slides (PDF) for The Vertex Cover Problem (9 min).pdf 1.2 MB
10 - X. INTRODUCTION TO DYNAMIC PROGRAMMING (Week 3)/1 - Slides (PDF) for Introduction_ Weighted Independent Sets in Path Graphs (8 min).pdf 1.18 MB
10 - X. INTRODUCTION TO DYNAMIC PROGRAMMING (Week 3)/4 - Slides (PDF) for WIS in Path Graphs_ A Reconstruction Algorithm (7 min).pdf 1.16 MB
3 - III. INTRODUCTION TO GREEDY ALGORITHMS (Week 1)/2 - Slides (PDF) for Application_ Optimal Caching (11 min).pdf 1.14 MB
5 - V. PRIM'S MINIMUM SPANNING TREE ALGORITHM (Week 1)/2 - Slides (PDF) for Prim's MST Algorithm (8 min).pdf 1.1 MB
16 - XVI. NP-COMPLETE PROBLEMS (Week 5)/6 - Slides (PDF) for Algorithmic Approaches to NP-Complete Problems (13 min).pdf 1.1 MB
5 - V. PRIM'S MINIMUM SPANNING TREE ALGORITHM (Week 1)/4 - Slides (PDF) for Correctness Proof II (8 min).pdf 1.06 MB
15 - XV. ALL-PAIRS SHORTEST PATHS (Week 4)/1 - Slides (PDF) for Problem Definition (7 min).pdf 1 MB
4 - IV. A SCHEDULING APPLICATION (Week 1)/4 - Slides (PDF) for Correctness Proof - Part II (5 min).pdf 950.25 KB
4 - IV. A SCHEDULING APPLICATION (Week 1)/1 - Slides (PDF) for Problem Definition (6 min).pdf 944.12 KB
10 - X. INTRODUCTION TO DYNAMIC PROGRAMMING (Week 3)/5 - Slides (PDF) for Principles of Dynamic Programming (8 min).pdf 862.1 KB
2 - II. SELECTED REVIEW FROM PART I (Week 1)/8 - Slides (PDF) for Data Structures_ Overview [Part I Review - Optional] (5).pdf 844.4 KB
6 - VI. KRUSKAL'S MINIMUM SPANNING TREE ALGORITHM (Week 2)/1 - Slides (PDF) for Kruskal's MST Algorithm (8 min).pdf 751.67 KB
2 - II. SELECTED REVIEW FROM PART I (Week 1)/4 - Slides (PDF) for Big-Oh Notation [Part I Review - Optional] (4 min).pdf 660.31 KB
2 - II. SELECTED REVIEW FROM PART I (Week 1)/1 - Slides (PDF) for About the Course [Part I Review - Optional] (17 min).pdf 209.06 KB
2 - II. SELECTED REVIEW FROM PART I (Week 1)/6 - Subtitles (srt) for Graph Search - Overview [Part I Review - Optional] (23 min).srt 37.05 KB
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 31.14 KB
2 - II. SELECTED REVIEW FROM PART I (Week 1)/1 - Subtitles (srt) for About the Course [Part I Review - Optional] (17 min).srt 29.11 KB
2 - II. SELECTED REVIEW FROM PART I (Week 1)/9 - Subtitles (srt) for Heaps_ Operations and Applications [Part I Review - Optional] (18).srt 27.79 KB
2 - II. SELECTED REVIEW FROM PART I (Week 1)/2 - Subtitles (srt) for Why Study Algorithms_ [Part I Review - Optional] (19 min) 27.27 KB
2 - II. SELECTED REVIEW FROM PART I (Week 1)/6 - Subtitles (text) for Graph Search - Overview [Part I Review - Optional] (23 min).txt 25.88 KB
9 - IX. HUFFMAN CODES (Week 2)/3 - Subtitles (srt) for A Greedy Algorithm (17 min).srt 24.45 KB
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 23.57 KB
19 - XIX. LOCAL SEARCH ALGORITHMS (Week 6)/6 - Subtitles (srt) for Random Walks on a Line (16 min).srt 22.86 KB
5 - V. PRIM'S MINIMUM SPANNING TREE ALGORITHM (Week 1)/6 - Subtitles (srt) for Fast Implementation I (15 min).srt 21.8 KB
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 21.78 KB
2 - II. SELECTED REVIEW FROM PART I (Week 1)/5 - Subtitles (srt) for Graph Representations [Part I Review - Optional] (14 min).srt 21.64 KB
5 - V. PRIM'S MINIMUM SPANNING TREE ALGORITHM (Week 1)/3 - Subtitles (srt) for Correctness Proof I (16 min).srt 21.52 KB
17 - XVII. FASTER EXACT ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 5)/4 - Subtitles (srt) for The Traveling Salesman Problem (15 min).srt 21.4 KB
8 - VIII. ADVANCED UNION-FIND (Week 2)/3 - Subtitles (srt) for Analysis of Union-by-Rank [Advanced - Optional](15).srt 21.07 KB
19 - XIX. LOCAL SEARCH ALGORITHMS (Week 6)/5 - Subtitles (srt) for The 2-SAT Problem (15 min).srt 20.89 KB
8 - VIII. ADVANCED UNION-FIND (Week 2)/4 - Subtitles (srt) for Path Compression [Advanced - Optional] (15).srt 20.72 KB
8 - VIII. ADVANCED UNION-FIND (Week 2)/7 - Subtitles (srt) for The Ackermann Function [Advanced - Optional](17 min).srt 20.71 KB
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 20.68 KB
4 - IV. A SCHEDULING APPLICATION (Week 1)/2 - Subtitles (srt) for A Greedy Algorithm (13 min).srt 20.29 KB
3 - III. INTRODUCTION TO GREEDY ALGORITHMS (Week 1)/1 - Subtitles (srt) for Introduction to Greedy Algorithms (13 min).srt 20.28 KB
2 - II. SELECTED REVIEW FROM PART I (Week 1)/1 - Subtitles (text) for About the Course [Part I Review - Optional] (17 min).txt 20.26 KB
15 - XV. ALL-PAIRS SHORTEST PATHS (Week 4)/3 - Subtitles (srt) for The Floyd-Warshall Algorithm (13 min).srt 20.2 KB
19 - XIX. LOCAL SEARCH ALGORITHMS (Week 6)/7 - Subtitles (srt) for Analysis of Papadimitriou's Algorithm (15 min).srt 20.14 KB
16 - XVI. NP-COMPLETE PROBLEMS (Week 5)/1 - Subtitles (srt) for Polynomial-Time Solvable Problems (14 min).srt 20.08 KB
18 - XVIII. APPROXIMATION ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 6)/6 - Subtitles (srt) for Ananysis of Dynamic Programming Heuristic (15 min).srt 19.97 KB
8 - VIII. ADVANCED UNION-FIND (Week 2)/8 - Subtitles (srt) for Path Compression_ Tarjan's Analysis I [Advanced - Optional].srt 19.87 KB
18 - XVIII. APPROXIMATION ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 6)/1 - Subtitles (srt) for A Greedy Knapsack Heuristic (14 min).srt 19.82 KB
12 - XII. SEQUENCE ALIGNMENT (Week 3)/1 - Subtitles (srt) for Optimal Substructure (14 min).srt 19.47 KB
2 - II. SELECTED REVIEW FROM PART I (Week 1)/9 - Subtitles (text) for Heaps_ Operations and Applications [Part I Review - Optional] (18).txt 19.42 KB
16 - XVI. NP-COMPLETE PROBLEMS (Week 5)/6 - Subtitles (srt) for Algorithmic Approaches to NP-Complete Problems (13 min).srt 19.19 KB
9 - IX. HUFFMAN CODES (Week 2)/5 - Subtitles (srt) for Correctness Proof II (13 min).srt 19.18 KB
15 - XV. ALL-PAIRS SHORTEST PATHS (Week 4)/4 - Subtitles (srt) for A Reweighting Technique (14 min).srt 18.97 KB
2 - II. SELECTED REVIEW FROM PART I (Week 1)/2 - Subtitles (text) for Why Study Algorithms_ [Part I Review - Optional] (19 min) 18.97 KB
13 - XIII. OPTIMAL BINARY SEARCH TREES (Week 3)/1 - Subtitles (srt) for Problem Definition (12 min).srt 18.81 KB
16 - XVI. NP-COMPLETE PROBLEMS (Week 5)/2 - Subtitles (srt) for Reductions and Completeness (14 min).srt 18.6 KB
20 - XX. THE WIDER WORLD OF ALGORITHMS (Week 6)/2 - Subtitles (srt) for Matchings, Flows, and Braess's Paradox [Optional] (14 min).srt 18.5 KB
8 - VIII. ADVANCED UNION-FIND (Week 2)/9 - Subtitles (srt) for Path Compression_ Tarjan's Analysis II [Advanced - Optional].srt 18.41 KB
20 - XX. THE WIDER WORLD OF ALGORITHMS (Week 6)/1 - Subtitles (srt) for Stable Matching [Optional] (15 min).srt 18.37 KB
15 - XV. ALL-PAIRS SHORTEST PATHS (Week 4)/2 - Subtitles (srt) for Optimal Substructure (12 min).srt 18.12 KB
8 - VIII. ADVANCED UNION-FIND (Week 2)/2 - Subtitles (srt) for Union-by-Rank [Advanced - Optional] (12 min).srt 18.08 KB
12 - XII. SEQUENCE ALIGNMENT (Week 3)/2 - Subtitles (srt) for A Dynamic Programming Algorithm (12 min).srt 17.8 KB
5 - V. PRIM'S MINIMUM SPANNING TREE ALGORITHM (Week 1)/5 - Subtitles (srt) for Proof of Cut Property [Advanced - Optional] (12 min).srt 17.64 KB
14 - XIV. THE BELLMAN-FORD ALGORITHM (Week 4)/7 - Subtitles (srt) for Internet Routing I [Optional] (11 min).srt 17.52 KB
14 - XIV. THE BELLMAN-FORD ALGORITHM (Week 4)/6 - Subtitles (srt) for A Space Optimization (12 min).srt 17.36 KB
9 - IX. HUFFMAN CODES (Week 2)/3 - Subtitles (text) for A Greedy Algorithm (17 min).txt 17.07 KB
7 - VII. CLUSTERING (Week 2)/1 - Subtitles (srt) for Application to Clustering (12 min).srt 16.95 KB
17 - XVII. FASTER EXACT ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 5)/5 - Subtitles (srt) for A Dynamic Programming Algorithm for TSP (12 min).srt 16.85 KB
5 - V. PRIM'S MINIMUM SPANNING TREE ALGORITHM (Week 1)/1 - Subtitles (srt) for MST Problem Definition (11 min).srt 16.84 KB
1 - I. TWO MOTIVATING APPLICATIONS (Week 1)/1 - Subtitles (srt) for Application_ Internet Routing (11 min).srt 16.62 KB
19 - XIX. LOCAL SEARCH ALGORITHMS (Week 6)/4 - Subtitles (srt) for Principles of Local Search II (10 min).srt 16.6 KB
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 16.49 KB
18 - XVIII. APPROXIMATION ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 6)/4 - Subtitles (srt) for A Dynamic Programming Heuristic for Knapsack (12 min).srt 16.43 KB
14 - XIV. THE BELLMAN-FORD ALGORITHM (Week 4)/1 - Subtitles (srt) for Single-Source Shortest Paths, Revisted (11 min).srt 16.33 KB
8 - VIII. ADVANCED UNION-FIND (Week 2)/6 - Subtitles (srt) for Path Compression_ The Hopcroft-Ullman Analysis II [Advanced - Optional].srt 16.2 KB
20 - XX. THE WIDER WORLD OF ALGORITHMS (Week 6)/3 - Subtitles (srt) for Linear Programming and Beyond [Optional] (11 min).srt 15.91 KB
19 - XIX. LOCAL SEARCH ALGORITHMS (Week 6)/6 - Subtitles (text) for Random Walks on a Line (16 min).txt 15.86 KB
3 - III. INTRODUCTION TO GREEDY ALGORITHMS (Week 1)/2 - Subtitles (srt) for Application_ Optimal Caching (11 min).srt 15.6 KB
15 - XV. ALL-PAIRS SHORTEST PATHS (Week 4)/6 - Subtitles (srt) for Johnson's Algorithm II (11 min).srt 15.51 KB
14 - XIV. THE BELLMAN-FORD ALGORITHM (Week 4)/2 - Subtitles (srt) for Optimal Substructure (11 min).srt 15.31 KB
5 - V. PRIM'S MINIMUM SPANNING TREE ALGORITHM (Week 1)/6 - Subtitles (text) for Fast Implementation I (15 min).txt 15.25 KB
2 - II. SELECTED REVIEW FROM PART I (Week 1)/5 - Subtitles (text) for Graph Representations [Part I Review - Optional] (14 min).txt 15.15 KB
5 - V. PRIM'S MINIMUM SPANNING TREE ALGORITHM (Week 1)/3 - Subtitles (text) for Correctness Proof I (16 min).txt 15.06 KB
13 - XIII. OPTIMAL BINARY SEARCH TREES (Week 3)/4 - Subtitles (srt) for A Dynamic Programming Algorithm I (10 min).srt 15.03 KB
7 - VII. CLUSTERING (Week 2)/2 - Subtitles (srt) for Correctness of Clustering Algorithm (10 min).srt 14.95 KB
17 - XVII. FASTER EXACT ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 5)/4 - Subtitles (text) for The Traveling Salesman Problem (15 min).txt 14.94 KB
8 - VIII. ADVANCED UNION-FIND (Week 2)/1 - Subtitles (srt) for Lazy Unions [Advanced - Optional] (10 min).srt 14.9 KB
14 - XIV. THE BELLMAN-FORD ALGORITHM (Week 4)/4 - Subtitles (srt) for The Basic Algorithm II (11 min).srt 14.84 KB
16 - XVI. NP-COMPLETE PROBLEMS (Week 5)/3 - Subtitles (srt) for Definition and Interpretation of NP-Completeness I (11 min).srt 14.71 KB
8 - VIII. ADVANCED UNION-FIND (Week 2)/3 - Subtitles (text) for Analysis of Union-by-Rank [Advanced - Optional](15).txt 14.69 KB
19 - XIX. LOCAL SEARCH ALGORITHMS (Week 6)/5 - Subtitles (text) for The 2-SAT Problem (15 min).txt 14.61 KB
9 - IX. HUFFMAN CODES (Week 2)/4 - Subtitles (srt) for Correctness Proof I (10 min).srt 14.57 KB
15 - XV. ALL-PAIRS SHORTEST PATHS (Week 4)/5 - Subtitles (srt) for Johnson's Algorithm I (11 min).srt 14.54 KB
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 14.47 KB
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 14.47 KB
13 - XIII. OPTIMAL BINARY SEARCH TREES (Week 3)/5 - Subtitles (srt) for A Dynamic Programming Algorithm II (9 min).srt 14.45 KB
9 - IX. HUFFMAN CODES (Week 2)/2 - Subtitles (srt) for Problem Definition (10 min).srt 14.45 KB
18 - XVIII. APPROXIMATION ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 6)/5 - Subtitles (srt) for Knapsack via Dynamic Programming, Revisited (10 min).srt 14.43 KB
13 - XIII. OPTIMAL BINARY SEARCH TREES (Week 3)/2 - Subtitles (srt) for Optimal Substructure (9 min).srt 14.41 KB
8 - VIII. ADVANCED UNION-FIND (Week 2)/4 - Subtitles (text) for Path Compression [Advanced - Optional] (15).txt 14.37 KB
10 - X. INTRODUCTION TO DYNAMIC PROGRAMMING (Week 3)/3 - Subtitles (srt) for WIS in Path Graphs_ A Linear-Time Algorithm (10 min).srt 14.37 KB
8 - VIII. ADVANCED UNION-FIND (Week 2)/7 - Subtitles (text) for The Ackermann Function [Advanced - Optional](17 min).txt 14.28 KB
4 - IV. A SCHEDULING APPLICATION (Week 1)/2 - Subtitles (text) for A Greedy Algorithm (13 min).txt 14.21 KB
18 - XVIII. APPROXIMATION ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 6)/3 - Subtitles (srt) for Analysis of a Greedy Knapsack Heuristic II (10 min).srt 14.21 KB
5 - V. PRIM'S MINIMUM SPANNING TREE ALGORITHM (Week 1)/7 - Subtitles (srt) for Fast Implementation II (10 min).srt 14.1 KB
3 - III. INTRODUCTION TO GREEDY ALGORITHMS (Week 1)/1 - Subtitles (text) for Introduction to Greedy Algorithms (13 min).txt 14.1 KB
15 - XV. ALL-PAIRS SHORTEST PATHS (Week 4)/3 - Subtitles (text) for The Floyd-Warshall Algorithm (13 min).txt 14.08 KB
19 - XIX. LOCAL SEARCH ALGORITHMS (Week 6)/7 - Subtitles (text) for Analysis of Papadimitriou's Algorithm (15 min).txt 14.02 KB
16 - XVI. NP-COMPLETE PROBLEMS (Week 5)/1 - Subtitles (text) for Polynomial-Time Solvable Problems (14 min).txt 13.97 KB
18 - XVIII. APPROXIMATION ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 6)/6 - Subtitles (text) for Ananysis of Dynamic Programming Heuristic (15 min).txt 13.96 KB
8 - VIII. ADVANCED UNION-FIND (Week 2)/8 - Subtitles (text) for Path Compression_ Tarjan's Analysis I [Advanced - Optional].txt 13.89 KB
18 - XVIII. APPROXIMATION ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 6)/1 - Subtitles (text) for A Greedy Knapsack Heuristic (14 min).txt 13.81 KB
19 - XIX. LOCAL SEARCH ALGORITHMS (Week 6)/2 - Subtitles (srt) for The Maximum Cut Problem II (9 min).srt 13.79 KB
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 13.77 KB
6 - VI. KRUSKAL'S MINIMUM SPANNING TREE ALGORITHM (Week 2)/2 - Subtitles (srt) for Correctness of Kruskal's Algorithm (9 min).srt 13.74 KB
11 - XI. THE KNAPSACK PROBLEM (Week 3)/2 - Subtitles (srt) for A Dynamic Programming Algorithm (10 min).srt 13.67 KB
12 - XII. SEQUENCE ALIGNMENT (Week 3)/1 - Subtitles (text) for Optimal Substructure (14 min).txt 13.63 KB
19 - XIX. LOCAL SEARCH ALGORITHMS (Week 6)/3 - Subtitles (srt) for Principles of Local Search I (9 min).srt 13.54 KB
9 - IX. HUFFMAN CODES (Week 2)/5 - Subtitles (text) for Correctness Proof II (13 min).txt 13.44 KB
16 - XVI. NP-COMPLETE PROBLEMS (Week 5)/6 - Subtitles (text) for Algorithmic Approaches to NP-Complete Problems (13 min).txt 13.42 KB
15 - XV. ALL-PAIRS SHORTEST PATHS (Week 4)/4 - Subtitles (text) for A Reweighting Technique (14 min).txt 13.3 KB
11 - XI. THE KNAPSACK PROBLEM (Week 3)/1 - Subtitles (srt) for The Knapsack Problem (10 min).srt 13.29 KB
14 - XIV. THE BELLMAN-FORD ALGORITHM (Week 4)/5 - Subtitles (srt) for Detecting Negative Cycles (9 min).srt 13.22 KB
9 - IX. HUFFMAN CODES (Week 2)/1 - Subtitles (srt) for Introduction and Motivation (9 min).srt 13.21 KB
13 - XIII. OPTIMAL BINARY SEARCH TREES (Week 3)/1 - Subtitles (text) for Problem Definition (12 min).txt 13.17 KB
8 - VIII. ADVANCED UNION-FIND (Week 2)/5 - Subtitles (srt) for Path Compression_ The Hopcroft-Ullman Analysis I [Advanced - Optional].srt 13.14 KB
17 - XVII. FASTER EXACT ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 5)/2 - Subtitles (srt) for Smarter Search for Vertex Cover I (10 min).srt 13.07 KB
16 - XVI. NP-COMPLETE PROBLEMS (Week 5)/2 - Subtitles (text) for Reductions and Completeness (14 min).txt 13 KB
20 - XX. THE WIDER WORLD OF ALGORITHMS (Week 6)/2 - Subtitles (text) for Matchings, Flows, and Braess's Paradox [Optional] (14 min).txt 12.97 KB
8 - VIII. ADVANCED UNION-FIND (Week 2)/9 - Subtitles (text) for Path Compression_ Tarjan's Analysis II [Advanced - Optional].txt 12.88 KB
20 - XX. THE WIDER WORLD OF ALGORITHMS (Week 6)/1 - Subtitles (text) for Stable Matching [Optional] (15 min).txt 12.87 KB
15 - XV. ALL-PAIRS SHORTEST PATHS (Week 4)/2 - Subtitles (text) for Optimal Substructure (12 min).txt 12.69 KB
8 - VIII. ADVANCED UNION-FIND (Week 2)/2 - Subtitles (text) for Union-by-Rank [Advanced - Optional] (12 min).txt 12.68 KB
10 - X. INTRODUCTION TO DYNAMIC PROGRAMMING (Week 3)/2 - Subtitles (srt) for WIS in Path Graphs_ Optimal Substructure (9 min).srt 12.62 KB
12 - XII. SEQUENCE ALIGNMENT (Week 3)/2 - Subtitles (text) for A Dynamic Programming Algorithm (12 min).txt 12.47 KB
5 - V. PRIM'S MINIMUM SPANNING TREE ALGORITHM (Week 1)/5 - Subtitles (text) for Proof of Cut Property [Advanced - Optional] (12 min).txt 12.38 KB
1 - I. TWO MOTIVATING APPLICATIONS (Week 1)/2 - Subtitles (srt) for Application_ Sequence Alignment (9 min).srt 12.38 KB
17 - XVII. FASTER EXACT ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 5)/1 - Subtitles (srt) for The Vertex Cover Problem (9 min).srt 12.36 KB
16 - XVI. NP-COMPLETE PROBLEMS (Week 5)/5 - Subtitles (srt) for The P vs. NP Question (9 min).srt 12.31 KB
14 - XIV. THE BELLMAN-FORD ALGORITHM (Week 4)/7 - Subtitles (text) for Internet Routing I [Optional] (11 min).txt 12.26 KB
6 - VI. KRUSKAL'S MINIMUM SPANNING TREE ALGORITHM (Week 2)/1 - Subtitles (srt) for Kruskal's MST Algorithm (8 min).srt 12.25 KB
14 - XIV. THE BELLMAN-FORD ALGORITHM (Week 4)/6 - Subtitles (text) for A Space Optimization (12 min).txt 12.13 KB
10 - X. INTRODUCTION TO DYNAMIC PROGRAMMING (Week 3)/1 - Subtitles (srt) for Introduction_ Weighted Independent Sets in Path Graphs (8 min).srt 11.96 KB
19 - XIX. LOCAL SEARCH ALGORITHMS (Week 6)/1 - Subtitles (srt) for The Maximum Cut Problem I (9 min).srt 11.93 KB
7 - VII. CLUSTERING (Week 2)/1 - Subtitles (text) for Application to Clustering (12 min).txt 11.86 KB
5 - V. PRIM'S MINIMUM SPANNING TREE ALGORITHM (Week 1)/1 - Subtitles (text) for MST Problem Definition (11 min).txt 11.82 KB
14 - XIV. THE BELLMAN-FORD ALGORITHM (Week 4)/3 - Subtitles (srt) for The Basic Algorithm I (9 min).srt 11.81 KB
17 - XVII. FASTER EXACT ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 5)/5 - Subtitles (text) for A Dynamic Programming Algorithm for TSP (12 min).txt 11.76 KB
5 - V. PRIM'S MINIMUM SPANNING TREE ALGORITHM (Week 1)/2 - Subtitles (srt) for Prim's MST Algorithm (8 min).srt 11.74 KB
5 - V. PRIM'S MINIMUM SPANNING TREE ALGORITHM (Week 1)/4 - Subtitles (srt) for Correctness Proof II (8 min).srt 11.72 KB
1 - I. TWO MOTIVATING APPLICATIONS (Week 1)/1 - Subtitles (text) for Application_ Internet Routing (11 min).txt 11.63 KB
19 - XIX. LOCAL SEARCH ALGORITHMS (Week 6)/4 - Subtitles (text) for Principles of Local Search II (10 min).txt 11.61 KB
18 - XVIII. APPROXIMATION ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 6)/4 - Subtitles (text) for A Dynamic Programming Heuristic for Knapsack (12 min).txt 11.48 KB
14 - XIV. THE BELLMAN-FORD ALGORITHM (Week 4)/1 - Subtitles (text) for Single-Source Shortest Paths, Revisted (11 min).txt 11.45 KB
10 - X. INTRODUCTION TO DYNAMIC PROGRAMMING (Week 3)/5 - Subtitles (srt) for Principles of Dynamic Programming (8 min).srt 11.42 KB
8 - VIII. ADVANCED UNION-FIND (Week 2)/6 - Subtitles (text) for Path Compression_ The Hopcroft-Ullman Analysis II [Advanced - Optional].txt 11.25 KB
20 - XX. THE WIDER WORLD OF ALGORITHMS (Week 6)/3 - Subtitles (text) for Linear Programming and Beyond [Optional] (11 min).txt 11.13 KB
4 - IV. A SCHEDULING APPLICATION (Week 1)/5 - Subtitles (srt) for Handling Ties [Advanced - Optional] (7 min).srt 11.03 KB
3 - III. INTRODUCTION TO GREEDY ALGORITHMS (Week 1)/2 - Subtitles (text) for Application_ Optimal Caching (11 min).txt 10.95 KB
16 - XVI. NP-COMPLETE PROBLEMS (Week 5)/4 - Subtitles (srt) for Definition and Interpretation of NP-Completeness II (8 min).srt 10.88 KB
15 - XV. ALL-PAIRS SHORTEST PATHS (Week 4)/6 - Subtitles (text) for Johnson's Algorithm II (11 min).txt 10.86 KB
17 - XVII. FASTER EXACT ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 5)/3 - Subtitles (srt) for Smarter Search for Vertex Cover II (8 min).srt 10.79 KB
4 - IV. A SCHEDULING APPLICATION (Week 1)/3 - Subtitles (srt) for Correctness Proof - Part I (7 min).srt 10.78 KB
14 - XIV. THE BELLMAN-FORD ALGORITHM (Week 4)/2 - Subtitles (text) for Optimal Substructure (11 min).txt 10.73 KB
13 - XIII. OPTIMAL BINARY SEARCH TREES (Week 3)/4 - Subtitles (text) for A Dynamic Programming Algorithm I (10 min).txt 10.52 KB
7 - VII. CLUSTERING (Week 2)/2 - Subtitles (text) for Correctness of Clustering Algorithm (10 min).txt 10.51 KB
8 - VIII. ADVANCED UNION-FIND (Week 2)/1 - Subtitles (text) for Lazy Unions [Advanced - Optional] (10 min).txt 10.43 KB
14 - XIV. THE BELLMAN-FORD ALGORITHM (Week 4)/4 - Subtitles (text) for The Basic Algorithm II (11 min).txt 10.36 KB
14 - XIV. THE BELLMAN-FORD ALGORITHM (Week 4)/8 - Subtitles (srt) for Internet Routing II [Optional] (7 min).srt 10.32 KB
16 - XVI. NP-COMPLETE PROBLEMS (Week 5)/3 - Subtitles (text) for Definition and Interpretation of NP-Completeness I (11 min).txt 10.3 KB
15 - XV. ALL-PAIRS SHORTEST PATHS (Week 4)/5 - Subtitles (text) for Johnson's Algorithm I (11 min).txt 10.21 KB
10 - X. INTRODUCTION TO DYNAMIC PROGRAMMING (Week 3)/4 - Subtitles (srt) for WIS in Path Graphs_ A Reconstruction Algorithm (7 min).srt 10.21 KB
9 - IX. HUFFMAN CODES (Week 2)/4 - Subtitles (text) for Correctness Proof I (10 min).txt 10.2 KB
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 10.14 KB
15 - XV. ALL-PAIRS SHORTEST PATHS (Week 4)/1 - Subtitles (srt) for Problem Definition (7 min).srt 10.13 KB
13 - XIII. OPTIMAL BINARY SEARCH TREES (Week 3)/5 - Subtitles (text) for A Dynamic Programming Algorithm II (9 min).txt 10.11 KB
9 - IX. HUFFMAN CODES (Week 2)/2 - Subtitles (text) for Problem Definition (10 min).txt 10.11 KB
13 - XIII. OPTIMAL BINARY SEARCH TREES (Week 3)/2 - Subtitles (text) for Optimal Substructure (9 min).txt 10.11 KB
18 - XVIII. APPROXIMATION ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 6)/5 - Subtitles (text) for Knapsack via Dynamic Programming, Revisited (10 min).txt 10.09 KB
10 - X. INTRODUCTION TO DYNAMIC PROGRAMMING (Week 3)/3 - Subtitles (text) for WIS in Path Graphs_ A Linear-Time Algorithm (10 min).txt 10.06 KB
18 - XVIII. APPROXIMATION ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 6)/3 - Subtitles (text) for Analysis of a Greedy Knapsack Heuristic II (10 min).txt 9.97 KB
5 - V. PRIM'S MINIMUM SPANNING TREE ALGORITHM (Week 1)/7 - Subtitles (text) for Fast Implementation II (10 min).txt 9.9 KB
19 - XIX. LOCAL SEARCH ALGORITHMS (Week 6)/2 - Subtitles (text) for The Maximum Cut Problem II (9 min).txt 9.66 KB
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 9.64 KB
6 - VI. KRUSKAL'S MINIMUM SPANNING TREE ALGORITHM (Week 2)/2 - Subtitles (text) for Correctness of Kruskal's Algorithm (9 min).txt 9.61 KB
11 - XI. THE KNAPSACK PROBLEM (Week 3)/2 - Subtitles (text) for A Dynamic Programming Algorithm (10 min).txt 9.57 KB
18 - XVIII. APPROXIMATION ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 6)/2 - Subtitles (srt) for Analysis of a Greedy Knapsack Heuristic I (7 min).srt 9.49 KB
19 - XIX. LOCAL SEARCH ALGORITHMS (Week 6)/3 - Subtitles (text) for Principles of Local Search I (9 min).txt 9.48 KB
11 - XI. THE KNAPSACK PROBLEM (Week 3)/1 - Subtitles (text) for The Knapsack Problem (10 min).txt 9.33 KB
14 - XIV. THE BELLMAN-FORD ALGORITHM (Week 4)/5 - Subtitles (text) for Detecting Negative Cycles (9 min).txt 9.29 KB
9 - IX. HUFFMAN CODES (Week 2)/1 - Subtitles (text) for Introduction and Motivation (9 min).txt 9.29 KB
4 - IV. A SCHEDULING APPLICATION (Week 1)/1 - Subtitles (srt) for Problem Definition (6 min).srt 9.28 KB
17 - XVII. FASTER EXACT ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 5)/2 - Subtitles (text) for Smarter Search for Vertex Cover I (10 min).txt 9.18 KB
8 - VIII. ADVANCED UNION-FIND (Week 2)/5 - Subtitles (text) for Path Compression_ The Hopcroft-Ullman Analysis I [Advanced - Optional].txt 9.17 KB
13 - XIII. OPTIMAL BINARY SEARCH TREES (Week 3)/3 - Subtitles (srt) for Proof of Optimal Substructure (7 min).srt 9.04 KB
10 - X. INTRODUCTION TO DYNAMIC PROGRAMMING (Week 3)/2 - Subtitles (text) for WIS in Path Graphs_ Optimal Substructure (9 min).txt 8.83 KB
17 - XVII. FASTER EXACT ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 5)/1 - Subtitles (text) for The Vertex Cover Problem (9 min).txt 8.68 KB
1 - I. TWO MOTIVATING APPLICATIONS (Week 1)/2 - Subtitles (text) for Application_ Sequence Alignment (9 min).txt 8.65 KB
16 - XVI. NP-COMPLETE PROBLEMS (Week 5)/5 - Subtitles (text) for The P vs. NP Question (9 min).txt 8.63 KB
6 - VI. KRUSKAL'S MINIMUM SPANNING TREE ALGORITHM (Week 2)/1 - Subtitles (text) for Kruskal's MST Algorithm (8 min).txt 8.56 KB
10 - X. INTRODUCTION TO DYNAMIC PROGRAMMING (Week 3)/1 - Subtitles (text) for Introduction_ Weighted Independent Sets in Path Graphs (8 min).txt 8.38 KB
19 - XIX. LOCAL SEARCH ALGORITHMS (Week 6)/1 - Subtitles (text) for The Maximum Cut Problem I (9 min).txt 8.38 KB
14 - XIV. THE BELLMAN-FORD ALGORITHM (Week 4)/3 - Subtitles (text) for The Basic Algorithm I (9 min).txt 8.29 KB
5 - V. PRIM'S MINIMUM SPANNING TREE ALGORITHM (Week 1)/2 - Subtitles (text) for Prim's MST Algorithm (8 min).txt 8.25 KB
5 - V. PRIM'S MINIMUM SPANNING TREE ALGORITHM (Week 1)/4 - Subtitles (text) for Correctness Proof II (8 min).txt 8.24 KB
10 - X. INTRODUCTION TO DYNAMIC PROGRAMMING (Week 3)/5 - Subtitles (text) for Principles of Dynamic Programming (8 min).txt 8.01 KB
4 - IV. A SCHEDULING APPLICATION (Week 1)/5 - Subtitles (text) for Handling Ties [Advanced - Optional] (7 min).txt 7.72 KB
16 - XVI. NP-COMPLETE PROBLEMS (Week 5)/4 - Subtitles (text) for Definition and Interpretation of NP-Completeness II (8 min).txt 7.64 KB
4 - IV. A SCHEDULING APPLICATION (Week 1)/3 - Subtitles (text) for Correctness Proof - Part I (7 min).txt 7.57 KB
17 - XVII. FASTER EXACT ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 5)/3 - Subtitles (text) for Smarter Search for Vertex Cover II (8 min).txt 7.54 KB
14 - XIV. THE BELLMAN-FORD ALGORITHM (Week 4)/8 - Subtitles (text) for Internet Routing II [Optional] (7 min).txt 7.24 KB
10 - X. INTRODUCTION TO DYNAMIC PROGRAMMING (Week 3)/4 - Subtitles (text) for WIS in Path Graphs_ A Reconstruction Algorithm (7 min).txt 7.16 KB
15 - XV. ALL-PAIRS SHORTEST PATHS (Week 4)/1 - Subtitles (text) for Problem Definition (7 min).txt 7.12 KB
2 - II. SELECTED REVIEW FROM PART I (Week 1)/8 - Subtitles (srt) for Data Structures_ Overview [Part I Review - Optional] (5).srt 7.01 KB
18 - XVIII. APPROXIMATION ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 6)/2 - Subtitles (text) for Analysis of a Greedy Knapsack Heuristic I (7 min).txt 6.61 KB
4 - IV. A SCHEDULING APPLICATION (Week 1)/1 - Subtitles (text) for Problem Definition (6 min).txt 6.53 KB
4 - IV. A SCHEDULING APPLICATION (Week 1)/4 - Subtitles (srt) for Correctness Proof - Part II (5 min).srt 6.43 KB
13 - XIII. OPTIMAL BINARY SEARCH TREES (Week 3)/3 - Subtitles (text) for Proof of Optimal Substructure (7 min).txt 6.36 KB
2 - II. SELECTED REVIEW FROM PART I (Week 1)/4 - Subtitles (srt) for Big-Oh Notation [Part I Review - Optional] (4 min).srt 6.19 KB
2 - II. SELECTED REVIEW FROM PART I (Week 1)/8 - Subtitles (text) for Data Structures_ Overview [Part I Review - Optional] (5).txt 4.93 KB
4 - IV. A SCHEDULING APPLICATION (Week 1)/4 - Subtitles (text) for Correctness Proof - Part II (5 min).txt 4.51 KB
2 - II. SELECTED REVIEW FROM PART I (Week 1)/4 - Subtitles (text) for Big-Oh Notation [Part I Review - Optional] (4 min).txt 4.34 KB
20 - XX. THE WIDER WORLD OF ALGORITHMS (Week 6)/4 - Subtitles (srt) for Epilogue (1 min).srt 1.73 KB
20 - XX. THE WIDER WORLD OF ALGORITHMS (Week 6)/4 - Subtitles (text) for Epilogue (1 min).txt 1.21 KB
Download Info
-
Tips
“Algorithms_ Design and Analysis, Part 2” Its related downloads are collected from the DHT sharing network, the site will be 24 hours of real-time updates, to ensure that you get the latest resources.This site is not responsible for the authenticity of the resources, please pay attention to screening.If found bad resources, please send a report below the right, we will be the first time shielding.
-
DMCA Notice and Takedown Procedure
If this resource infringes your copyright, please email([email protected]) us or leave your message here ! we will block the download link as soon as possiable.