种子简介

种子名称： Coursera - Algorithms part 1 (2013)
文件类型： 视频
文件数目： 72个文件
文件大小： 1.18 GB
收录时间： 2017-11-9 10:09
已经下载： 3次
资源热度： 110
最近下载： 2024-7-12 02:48

下载BT种子文件

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

磁力链接下载

magnet:?xt=urn:btih:0dcf2c97893be74b5b2b8234d1a703990c909b46&dn=Coursera - Algorithms part 1 (2013) 复制链接到迅雷、QQ旋风进行下载，或者使用百度云离线下载。

喜欢这个种子的人也喜欢

种子包含的文件

Coursera - Algorithms part 1 (2013).torrent

video/014_3 - 4 - O(n log n) Algorithm for Closest Pair I [Advanced - Optional] (32 min).mp436.22MB

video/060_16 - 3 - Binary Search Tree Basics Part II (30 min).mp429.97MB

video/040_9 - 4 - Analysis of Contraction Algorithm (30 min).mp429.87MB

video/048_10 - 7 - Computing Strong Components The Algorithm (29 min).mp429.5MB

video/049_10 - 8 - Computing Strong Components The Analysis (26 min).mp426.77MB

video/054_11 - 4 - Dijkstras Algorithm Implementation and Running Time (26 min).mp426.46MB

video/068_14 - 2 - Universal Hashing Definition and Example [Advanced - Optional] (26 min).mp426.15MB

video/029_7 - 1 - Part I [Review - Optional] (25 min).mp425.42MB

video/023_5 - 2 - Partitioning Around a Pivot (25 min).mp424.84MB

video/013_3 - 3 - Strassens Subcubic Matrix Multiplication Algorithm (22 min).mp423.57MB

video/042_10 - 1 - Graph Search - Overview (23 min).mp423.25MB

video/034_8 - 4 - Deterministic Selection - Analysis I [Advanced - Optional] (22 min).mp422.82MB

video/066_13 - 3 - Hash Tables Implementation Details Part II (22 min).mp422.53MB

video/067_14 - 1 - Pathological Data Sets and Universal Hashing Motivation (22 min).mp422.49MB

video/047_10 - 6 - Topological Sort (22 min).mp422.08MB

video/061_16 - 4 - Red-Black Trees (21 min).mp421.83MB

video/025_5 - 4 - Choosing a Good Pivot (22min).mp421.74MB

video/026_6 - 1 - Analysis I A Decomposition Principle [Advanced - Optional] (22 min).mp421.65MB

video/031_8 - 1 - Randomized Selection - Algorithm (22 min).mp421.4MB

video/051_11 - 1 - Dijkstras Shortest-Path Algorithm (21 min).mp420.96MB

video/057_12 - 3 - Heaps Implementation Details [Advanced - Optional] (21 min).mp420.92MB

video/063_16 - 6 - Insertion in a Red-Black Tree [Advanced] (15 min).mp420.78MB

video/032_8 - 2 - Randomized Selection - Analysis (21 min).mp420.62MB

video/053_11 - 3 - Correctness of Dijkstras Algorithm [Advanced - Optional] (19 min).mp420.31MB

video/015_3 - 5 - O(n log n) Algorithm for Closest Pair II [Advanced - Optional] (19 min).mp420.14MB

video/065_13 - 2 - Hash Tables Implementation Details Part I (19 min).mp419.88MB

video/064_13 - 1 - Hash Tables Operations and Applications (19 min).mp419.73MB

video/001_1 - 1 - Introduction Why Study Algorithms (19 min).mp419.14MB

video/050_10 - 9 - Structure of the Web [Optional] (19 min).mp418.63MB

video/056_12 - 2 - Heaps Operations and Applications (18 min).mp418.62MB

video/069_14 - 3 - Universal Hashing Analysis of Chaining [Advanced - Optional] (19 min).mp418.46MB

video/006_1 - 6 - Guiding Principles for Analysis of Algorithms (15 min).mp417.99MB

video/033_8 - 3 - Deterministic Selection - Algorithm [Advanced - Optional] (17 min).mp417.55MB

video/002_1 - 2 - About the Course (17 min).mp417.37MB

video/030_7 - 2 - Part II [Review - Optional] (17 min).mp417.26MB

video/012_3 - 2 - O(n log n) Algorithm for Counting Inversions II (17 min).mp417.19MB

video/021_4 - 6 - Proof II (16 min).mp416.6MB

video/038_9 - 2 - Graph Representations (14 min).mp415.69MB

video/070_14 - 4 - Hash Table Performance with Open Addressing [Advanced - Optional] (16 min).mp415.6MB

video/071_15 - 1 - Bloom Filters The Basics (16 min).mp415.43MB

video/037_9 - 1 - Graphs and Minimum Cuts (16 min).mp415.21MB

video/004_1 - 4 - Merge Sort Pseudocode (13 min).mp415.01MB

video/018_4 - 3 - Examples (13 min).mp414.4MB

video/043_10 - 2 - Breadth-First Search (BFS) The Basics (14 min).mp414.28MB

video/045_10 - 4 - BFS and Undirected Connectivity (13 min).mp413.7MB

video/036_8 - 6 - Omega(n log n) Lower Bound for Comparison-Based Sorting [Advanced - Optional] (13 min).mp413.68MB

video/072_15 - 2 - Bloom Filters Heuristic Analysis (13 min).mp413.57MB

video/059_16 - 2 - Binary Search Tree Basics Part I (13 min).mp413.28MB

video/020_4 - 5 - Interpretation of the 3 Cases (11 min).mp413.11MB

video/052_11 - 2 - Dijkstras Algorithm Examples (13 min).mp412.88MB

video/011_3 - 1 - O(n log n) Algorithm for Counting Inversions I (13 min).mp412.85MB

video/035_8 - 5 - Deterministic Selection - Analysis II [Advanced - Optional] (13 min).mp412.83MB

video/022_5 - 1 - Quicksort Overview (12 min).mp412.19MB

video/027_6 - 2 - Analysis II The Key Insight [Advanced - Optional] (12min).mp411.98MB

video/024_5 - 3 - Correctness of Quicksort [Review - Optional] (11 min).mp411.82MB

video/019_4 - 4 - Proof I (10 min).mp411.46MB

video/005_1 - 5 - Merge Sort Analysis (9 min).mp411.31MB

video/058_16 - 1 - Balanced Search Trees Operations and Applications (11 min).mp410.99MB

video/003_1 - 3 - Merge Sort Motivation and Example (9 min).mp410.68MB

video/017_4 - 2 - Formal Statement (10 min).mp410.42MB

video/062_16 - 5 - Rotations [Advanced - Optional] (8 min).mp410.32MB

video/028_6 - 3 - Analysis III Final Calculations [Advanced - Optional] (9min).mp48.92MB

video/039_9 - 3 - Random Contraction Algorithm (9 min).mp48.28MB

video/016_4 - 1 - Motivation (8 min).mp48.25MB

video/044_10 - 3 - BFS and Shortest Paths (8 min).mp47.9MB

video/010_2 - 4 - Additional Examples [Review - Optional] (8 min).mp47.72MB

video/009_2 - 3 - Big Omega and Theta (7 min).mp47.49MB

video/041_9 - 5 - Counting Minimum Cuts (7 min).mp47.41MB

video/008_2 - 2 - Basic Examples (7 min).mp47.3MB

video/046_10 - 5 - Depth-First Search (DFS) The Basics (7 min).mp47.16MB

video/055_12 - 1 - Data Structures Overview (5 min).mp44.66MB

video/007_2 - 1 - Big-Oh Notation (4 min).mp44.13MB