Design and Analysis of Algorithms I

收录时间:2018-05-07 21:26:44
文件大小:768MB
下载次数:163
最近下载:2021-01-12 04:05:02
磁力链接:
magnet:?xt=urn:btih:3304626a2747bac5ba8963b41c10c4b073e5871f

立即下载 复制链接

文件列表

III. DIVIDE & CONQUER ALGORITHMS (Week 1)/4 O(n log n) Algorithm for Closest Pair I [Advanced - Optional] (32 min).webm 24MB
X. GRAPH SEARCH AND CONNECTIVITY (Week 4)/7 Computing Strong Components- The Algorithm (29 min).webm 22MB
IX. GRAPHS AND THE CONTRACTION ALGORITHM (Week 3)/4 Analysis of Contraction Algorithm (30 min).webm 22MB
XI. DIJKSTRA'S SHORTEST-PATH ALGORITHM (Week 5)/4 Dijkstra's Algorithm- Implementation and Running Time (26 min).webm 20MB
XII. DATA STRUCTURES (Week 5)/8 Universal Hashing- The Mathematics, Part I [Optional] (27 min).webm 19MB
X. GRAPH SEARCH AND CONNECTIVITY (Week 4)/8 Computing Strong Components- The Analysis (26 min).webm 19MB
VII. PROBABILITY REVIEW (Weeks 2-3)/1 Part I [Review - Optional] (25 min).webm 19MB
V. QUICKSORT - ALGORITHM (Week 2)/2 Partitioning Around a Pivot (25 min).webm 18MB
XII. DATA STRUCTURES (Week 5)/6 Hash Tables- Implementation Details, Part I (19 min).webm 17MB
XII. DATA STRUCTURES (Week 5)/7 Universal Hashing- Motivation [Optional] (22 min).webm 17MB
X. GRAPH SEARCH AND CONNECTIVITY (Week 4)/1 Graph Search - Overview (23 min).webm 16MB
VIII. LINEAR-TIME SELECTION (Week 3)/1 Randomized Selection - Algorithm (22 min).webm 16MB
VIII. LINEAR-TIME SELECTION (Week 3)/4 Deterministic Selection - Analysis I [Advanced - Optional] (22 min).webm 16MB
III. DIVIDE & CONQUER ALGORITHMS (Week 1)/3 Strassen's Subcubic Matrix Multiplication Algorithm (22 min).webm 16MB
XII. DATA STRUCTURES (Week 5)/3 Heaps- Implementation Details [Advanced - Optional] (21 min).webm 16MB
VI. QUICKSORT - ANALYSIS (Week 2)/1 Analysis I- A Decomposition Principle [Advanced - Optional] (22 min).webm 16MB
V. QUICKSORT - ALGORITHM (Week 2)/4 Choosing a Good Pivot (22min).webm 16MB
X. GRAPH SEARCH AND CONNECTIVITY (Week 4)/6 Topological Sort (22 min).webm 16MB
XI. DIJKSTRA'S SHORTEST-PATH ALGORITHM (Week 5)/1 Dijkstra's Shortest-Path Algorithm (21 min).webm 15MB
XII. DATA STRUCTURES (Week 5)/4 Hash Tables- Operations and Applications (19 min).webm 15MB
III. DIVIDE & CONQUER ALGORITHMS (Week 1)/5 O(n log n) Algorithm for Closest Pair II [Advanced - Optional] (19 min).webm 15MB
III. DIVIDE & CONQUER ALGORITHMS (Week 1)/2 O(n log n) Algorithm for Counting Inversions II (17 min).webm 14MB
VIII. LINEAR-TIME SELECTION (Week 3)/2 Randomized Selection - Analysis (21 min).webm 14MB
XI. DIJKSTRA'S SHORTEST-PATH ALGORITHM (Week 5)/3 Correctness of Dijkstra's Algorithm [Advanced - Optional] (19 min).webm 14MB
XII. DATA STRUCTURES (Week 5)/5 Hash Tables- Implementation Details, Part I (19 min).webm 14MB
I. INTRODUCTION (Week 1)/6 Guiding Principles for Analysis of Algorithms (15 min).webm 14MB
I. INTRODUCTION (Week 1)/1 Introduction Why Study Algorithms (19 min).webm 14MB
XII. DATA STRUCTURES (Week 5)/2 Heaps- Operations and Applications (18 min).webm 14MB
X. GRAPH SEARCH AND CONNECTIVITY (Week 4)/9 Structure of the Web [Optional] (19 min).webm 13MB
VIII. LINEAR-TIME SELECTION (Week 3)/3 Deterministic Selection - Algorithm [Advanced - Optional] (17 min).webm 13MB
I. INTRODUCTION (Week 1)/4 Merge Sort Pseudocode (13 min).webm 13MB
VII. PROBABILITY REVIEW (Weeks 2-3)/2 Part II [Review - Optional] (17 min).webm 13MB
IV. THE MASTER METHOD (Week 2)/6 Proof II (16 min).webm 12MB
I. INTRODUCTION (Week 1)/2 About the Course (17 min).webm 12MB
IX. GRAPHS AND THE CONTRACTION ALGORITHM (Week 3)/1 Graphs and Minimum Cuts (16 min).webm 11MB
X. GRAPH SEARCH AND CONNECTIVITY (Week 4)/4 BFS and Undirected Connectivity (13 min).webm 11MB
IX. GRAPHS AND THE CONTRACTION ALGORITHM (Week 3)/2 Graph Representations (14 min).webm 11MB
IV. THE MASTER METHOD (Week 2)/3 Examples (13 min).webm 10MB
X. GRAPH SEARCH AND CONNECTIVITY (Week 4)/2 Breadth-First Search (BFS)- The Basics (14 min).webm 10MB
I. INTRODUCTION (Week 1)/5 Merge Sort Analysis (9 min).webm 10MB
IV. THE MASTER METHOD (Week 2)/5 Interpretation of the 3 Cases (11 min).webm 10MB
III. DIVIDE & CONQUER ALGORITHMS (Week 1)/1 O(n log n) Algorithm for Counting Inversions I (13 min).webm 10MB
VIII. LINEAR-TIME SELECTION (Week 3)/6 Omega(n log n) Lower Bound for Comparison-Based Sorting [Advanced - Optional] (13 min).webm 10MB
VIII. LINEAR-TIME SELECTION (Week 3)/5 Deterministic Selection - Analysis II [Advanced - Optional] (13 min).webm 10MB
IV. THE MASTER METHOD (Week 2)/4 Proof I (10 min).webm 9MB
XI. DIJKSTRA'S SHORTEST-PATH ALGORITHM (Week 5)/2 Dijkstra's Algorithm- Examples (13 min).webm 9MB
I. INTRODUCTION (Week 1)/3 Merge Sort Motivation and Example (9 min).webm 9MB
V. QUICKSORT - ALGORITHM (Week 2)/3 Correctness of Quicksort [Review - Optional] (11 min).webm 9MB
IV. THE MASTER METHOD (Week 2)/2 Formal Statement (10 min).webm 9MB
VI. QUICKSORT - ANALYSIS (Week 2)/2 Analysis II- The Key Insight [Advanced - Optional] (12min).webm 9MB
IV. THE MASTER METHOD (Week 2)/1 Motivation (8 min).webm 7MB
V. QUICKSORT - ALGORITHM (Week 2)/1 Quicksort- Overview (12 min).webm 6MB
VI. QUICKSORT - ANALYSIS (Week 2)/3 Analysis III- Final Calculations [Advanced - Optional] (9min).webm 6MB
IX. GRAPHS AND THE CONTRACTION ALGORITHM (Week 3)/3 Random Contraction Algorithm (9 min).webm 6MB
II. ASYMPTOTIC ANALYSIS (Week 1)/4 Additional Examples [Review - Optional] (8 min).webm 6MB
II. ASYMPTOTIC ANALYSIS (Week 1)/3 Basic Examples (7 min).webm 6MB
II. ASYMPTOTIC ANALYSIS (Week 1)/2 Basic Examples (7 min).webm 6MB
X. GRAPH SEARCH AND CONNECTIVITY (Week 4)/3 BFS and Shortest Paths (8 min).webm 5MB
IX. GRAPHS AND THE CONTRACTION ALGORITHM (Week 3)/5 Counting Minimum Cuts [Advanced - Optional] (7 min).webm 5MB
X. GRAPH SEARCH AND CONNECTIVITY (Week 4)/5 Depth-First Search (DFS) The Basics (7 min).webm 5MB
XII. DATA STRUCTURES (Week 5)/1 Data Structures- Overview (5 min).webm 3MB
II. ASYMPTOTIC ANALYSIS (Week 1)/1 Big-Oh Notation (4 min).webm 3MB