种子简介

种子名称： Design and Analysis of Algorithms
文件类型： 视频
文件数目： 52个文件
文件大小： 824.48 MB
收录时间： 2017-5-28 12:23
已经下载： 3次
资源热度： 126
最近下载： 2025-1-11 15:32

下载BT种子文件

下载Torrent文件(.torrent) 立即下载

磁力链接下载

magnet:?xt=urn:btih:10e99ac5037f8957a0b1b03fb8489bf4456e3e3a&dn=Design and Analysis of Algorithms 复制链接到迅雷、QQ旋风进行下载，或者使用百度云离线下载。

喜欢这个种子的人也喜欢

种子包含的文件

Design and Analysis of Algorithms.torrent

Design and Analysis of Algorithms/Week1/I/1 - 2 - About the Course (17 min).mp4308.84KB

Design and Analysis of Algorithms/Week1/II/2 - 1 - Big-Oh Notation (4 min).mp44.13MB

Design and Analysis of Algorithms/Week5/XII/12 - 1 - Data Structures.mp44.66MB

Design and Analysis of Algorithms/Week4/X/10 - 5 - Depth-First Search (DFS)- The Basics (7 min).mp47.16MB

Design and Analysis of Algorithms/Week1/II/2 - 2 - Basic Examples (7 min).mp47.3MB

Design and Analysis of Algorithms/Week3/IX/9 - 5 - Counting Minimum Cuts [Advanced - Optional] (7 min).mp47.42MB

Design and Analysis of Algorithms/Week1/II/2 - 3 - Big Omega and Theta (7 min).mp47.49MB

Design and Analysis of Algorithms/Week1/II/2 - 4 - Additional Examples [Review - Optional] (8 min).mp47.72MB

Design and Analysis of Algorithms/Week4/X/10 - 3 - BFS and Shortest Paths (8 min).mp47.9MB

Design and Analysis of Algorithms/Week2/4 - 1 - Motivation (8 min).mp48.26MB

Design and Analysis of Algorithms/Week3/IX/9 - 3 - Random Contraction Algorithm (9 min).mp48.28MB

Design and Analysis of Algorithms/Week2/6 - 3 - Analysis III_ Final Calculations [Advanced - Optional] (9min).mp48.92MB

Design and Analysis of Algorithms/Week2/4 - 2 - Formal Statement (10 min).mp410.43MB

Design and Analysis of Algorithms/Week1/I/1 - 3 - Merge Sort_ Motivation and Example (9 min).mp410.69MB

Design and Analysis of Algorithms/Week1/I/1 - 5 - Merge Sort_ Analysis (9 min).mp411.32MB

Design and Analysis of Algorithms/Week2/4 - 4 - Proof I (10 min).mp411.46MB

Design and Analysis of Algorithms/Week2/5 - 3 - Correctness of Quicksort [Review - Optional] (11 min).mp411.83MB

Design and Analysis of Algorithms/Week2/6 - 2 - Analysis II_ The Key Insight [Advanced - Optional] (12min).mp411.98MB

Design and Analysis of Algorithms/Week2/5 - 1 - Quicksort_ Overview (12 min).mp412.2MB

Design and Analysis of Algorithms/Week1/III/3 - 1 - O(n log n) Algorithm for Counting Inversions I (13 min).mp412.86MB

Design and Analysis of Algorithms/Week5/XI/11 - 2 - Djikstra_'s Algorithm.mp412.88MB

Design and Analysis of Algorithms/Week2/4 - 5 - Interpretation of the 3 Cases (11 min).mp413.12MB

Design and Analysis of Algorithms/Week4/X/10 - 4 - BFS and Undirected Connectivity (13 min).mp413.7MB

Design and Analysis of Algorithms/Week3/IX/9 - 2 - Graph Representations (14 min).mp413.81MB

Design and Analysis of Algorithms/Week4/X/10 - 2 - Breadth-First Search (BFS)- The Basics (14 min).mp414.28MB

Design and Analysis of Algorithms/Week2/4 - 3 - Examples (13 min).mp414.4MB

Design and Analysis of Algorithms/Week1/I/1 - 4 - MergeSort-2 .mp415.01MB

Design and Analysis of Algorithms/Week3/IX/9 - 1 - Graphs and Minimum Cuts (16 min).mp415.21MB

Design and Analysis of Algorithms/Week2/4 - 6 - Proof II (16 min).mp416.6MB

Design and Analysis of Algorithms/Week1/III/3 - 2 - O(n log n) Algorithm for Counting Inversions II (17 min).mp417.19MB

Design and Analysis of Algorithms/Week1/I/1 - 6 - Guiding Principles for Analysis of Algorithms (15 min).mp418MB

Design and Analysis of Algorithms/Week5/XII/12 - 2 - Heaps.mp418.63MB

Design and Analysis of Algorithms/Week4/X/10 - 9 - Structure of the Web [Optional] (19 min).mp418.63MB

Design and Analysis of Algorithms/Week1/I/1 - 1 - Introduction _ Why Study Algorithms _ (19 min).mp419.1MB

Design and Analysis of Algorithms/Week1/III/3 - 5 - O(n log n) Algorithm for Closest Pair II [Advanced - Optional] (19 min).mp420.15MB

Design and Analysis of Algorithms/Week5/XI/11 - 3 - Correctness of Dijkstra_'s Algorithm [Advanced - Optional] (19 min).mp420.31MB

Design and Analysis of Algorithms/Week3/VIII/8 - 2 - Randomized Select Analysis (22 min).mp420.62MB

Design and Analysis of Algorithms/Week5/XII/12 - 3 - Heaps.mp420.93MB

Design and Analysis of Algorithms/Week5/XI/11 - 1 - Djikstra_'s Shortest-Path Algorithm (21 min).mp420.96MB

Design and Analysis of Algorithms/Week3/VIII/8 - 1 - Randomized Select (22 min).mp421.4MB

Design and Analysis of Algorithms/Week2/6 - 1 - Analysis I_ A Decomposition Principle [Advanced - Optional] (22 min).mp421.65MB

Design and Analysis of Algorithms/Week2/5 - 4 - Choosing a Good Pivot (22min).mp421.74MB

Design and Analysis of Algorithms/Week4/X/10 - 6 - Topological Sort (22 min).mp422.08MB

Design and Analysis of Algorithms/Week4/X/10 - 1 - Graph Search - Overview (23 min).mp423.26MB

Design and Analysis of Algorithms/Week1/III/3 - 3 - Strassen's Subcubic Matrix Multiplication Algorithm (22 min).mp423.57MB

Design and Analysis of Algorithms/Week2/5 - 2 - Partitioning Around a Pivot (25 min).mp424.84MB

Design and Analysis of Algorithms/Week2/7 - 1 - Part I [Review - Optional] (25 min).mp425.42MB

Design and Analysis of Algorithms/Week5/XI/11 - 4 - Dijkstra_'s Algorithm.mp426.46MB

Design and Analysis of Algorithms/Week4/X/10 - 8 - Computing Strong Components- The Analysis (26 min).mp426.77MB

Design and Analysis of Algorithms/Week4/X/10 - 7 - Computing Strong Components- The Algorithm (29 min).mp429.5MB

Design and Analysis of Algorithms/Week3/IX/9 - 4 - Analysis of Contraction Algorithm (30 min).mp429.83MB

Design and Analysis of Algorithms/Week1/III/3 - 4 - O(n log n) Algorithm for Closest Pair I [Advanced - Optional] (32 min).mp432.12MB