种子简介
种子名称:
Algorithms Design and Analysis, Part 1
文件类型:
视频
文件数目:
52个文件
文件大小:
839.01 MB
收录时间:
2017-8-22 22:18
已经下载:
3次
资源热度:
119
最近下载:
2024-12-21 07:26
下载BT种子文件
下载Torrent文件(.torrent)
立即下载
磁力链接下载
magnet:?xt=urn:btih:a7a4888317c96040ced327af790374b7ad9047bd&dn=Algorithms Design and Analysis, Part 1
复制链接到迅雷、QQ旋风进行下载,或者使用百度云离线下载。
喜欢这个种子的人也喜欢
种子包含的文件
Algorithms Design and Analysis, Part 1.torrent
III. DIVIDE & CONQUER ALGORITHMS (Week 1)/3 - 4 - O(n log n) Algorithm for Closest Pair I [Advanced - Optional] (32 min).mp436.22MB
Section 9/9 - 4 - Analysis of Contraction Algorithm (30 min).mp429.87MB
Week 4/4.1/recoded_videos_4.4 scc1 [a7a75b82] .mp429.5MB
II. ASYMPTOTIC ANALYSIS (Week 1)/2 - 1 - The Gist (14 min).mp427.68MB
Week 4/4.1/recoded_videos_4.5 Sccanalysis [970d3288] .mp426.77MB
V. QUICKSORT - ALGORITHM (Week 2)/5 - 2 - Partitioning Around a Pivot (25 min).mp424.84MB
III. DIVIDE & CONQUER ALGORITHMS (Week 1)/3 - 3 - Strassens Subcubic Matrix Multiplication Algorithm (22 min).mp423.57MB
Week 4/4.1/recoded_videos_4.1 search [8c8d19c3] .mp423.25MB
Section 8/8 - 4 - Deterministic Selection - Analysis I [Advanced - Optional] (22 min).mp422.82MB
Week 4/4.1/recoded_videos_4.3b Topological Sort [ab8e1fef] .mp422.08MB
V. QUICKSORT - ALGORITHM (Week 2)/5 - 4 - Choosing a Good Pivot (22min).mp421.74MB
V. QUICKSORT - ALGORITHM (Week 2)/5 - 4 - Choosing a Good Pivot (22min)_2.mp421.74MB
I. INTRODUCTION (Week 1)/1 - 3 - Karatsuba Multiplication (13 min).mp421.66MB
VI. QUICKSORT - ANALYSIS (Week 2)/6 - 1 - Analysis I A Decomposition Principle [Advanced - Optional] (22 min).mp421.65MB
Section 8/8 - 1 - Randomized Selection - Algorithm (22 min).mp421.4MB
Section 8/8 - 2 - Randomized Selection - Analysis (21 min).mp420.62MB
III. DIVIDE & CONQUER ALGORITHMS (Week 1)/3 - 5 - O(n log n) Algorithm for Closest Pair II [Advanced - Optional] (19 min).mp420.14MB
Week 4/4.1/recoded_videos_webs1 optional video 1 .mp418.63MB
I. INTRODUCTION (Week 1)/1 - 8 - Guiding Principles for Analysis of Algorithms (15 min).mp417.99MB
Section 8/8 - 3 - Deterministic Selection - Algorithm [Advanced - Optional] (17 min).mp417.55MB
I. INTRODUCTION (Week 1)/1 - 4 - About the Course (17 min).mp417.37MB
III. DIVIDE & CONQUER ALGORITHMS (Week 1)/3 - 2 - O(n log n) Algorithm for Counting Inversions II (17 min).mp417.19MB
I. INTRODUCTION (Week 1)/1 - 2 - Integer Multiplication (9 min).mp416.86MB
IV. THE MASTER METHOD (Week 2)/4 - 6 - Proof II (16 min).mp416.6MB
Section 9/9 - 2 - Graph Representations (14 min).mp415.69MB
Section 9/9 - 1 - Graphs and Minimum Cuts (16 min).mp415.21MB
I. INTRODUCTION (Week 1)/1 - 6 - Merge Sort Pseudocode (13 min).mp4.mp415.01MB
IV. THE MASTER METHOD (Week 2)/4 - 3 - Examples (13 min).mp414.4MB
Week 4/4.1/recoded_videos_4.2 BFS-basics [7ed1905b] .mp414.28MB
Week 4/4.1/recoded_videos_4.2c BFS-uc [81cf5c30] .mp413.7MB
IV. THE MASTER METHOD (Week 2)/4 - 5 - Interpretation of the 3 Cases (11 min).mp413.11MB
Section 8/8 - 5 - Deterministic Selection - Analysis II [Advanced - Optional] (13 min).mp412.83MB
III. DIVIDE & CONQUER ALGORITHMS (Week 1)/3 - 1 - O(n log n) Algorithm for Counting Inversions I (13 min).mp412.8MB
V. QUICKSORT - ALGORITHM (Week 2)/5 - 1 - Quicksort Overview (12 min).mp412.19MB
VI. QUICKSORT - ANALYSIS (Week 2)/6 - 2 - Analysis II The Key Insight [Advanced - Optional] (12min).mp411.98MB
V. QUICKSORT - ALGORITHM (Week 2)/5 - 3 - Correctness of Quicksort [Review - Optional] (11 min).mp411.82MB
V. QUICKSORT - ALGORITHM (Week 2)/5 - 3 - Correctness of Quicksort [Review - Optional] (11 min)_2.mp411.82MB
IV. THE MASTER METHOD (Week 2)/4 - 4 - Proof I (10 min).mp411.46MB
I. INTRODUCTION (Week 1)/1 - 7 - Merge Sort Analysis (9 min).mp411.31MB
I. INTRODUCTION (Week 1)/1 - 5 - Merge Sort Motivation and Example (9 min).mp410.68MB
IV. THE MASTER METHOD (Week 2)/4 - 2 - Formal Statement (10 min).mp410.42MB
VI. QUICKSORT - ANALYSIS (Week 2)/6 - 3 - Analysis III Final Calculations [Advanced - Optional] (9min).mp48.92MB
Section 9/9 - 3 - Random Contraction Algorithm (9 min).mp48.28MB
IV. THE MASTER METHOD (Week 2)/4 - 1 - Motivation (8 min).mp48.25MB
I. INTRODUCTION (Week 1)/1 - 1 - Why Study Algorithms (4 min).mp47.98MB
Week 4/4.1/recoded_videos_4.2b BFS-sp [851474ea] .mp47.9MB
II. ASYMPTOTIC ANALYSIS (Week 1)/2 - 5 - Additional Examples [Review - Optional] (8 min).mp47.72MB
II. ASYMPTOTIC ANALYSIS (Week 1)/2 - 4 - Big Omega and Theta (7 min).mp47.49MB
Section 9/9 - 5 - Counting Minimum Cuts (7 min).mp47.41MB
II. ASYMPTOTIC ANALYSIS (Week 1)/2 - 3 - Basic Examples (7 min).mp47.3MB
Week 4/4.1/recoded_videos_4.3 DFS-basics [b2b59f7c] .mp47.16MB
II. ASYMPTOTIC ANALYSIS (Week 1)/2 - 2 - Big-Oh Notation (4 min).mp44.13MB