zhongziso种子搜
首页
功能
磁力转BT
BT转磁力
使用教程
免责声明
关于
zhongziso
搜索
Coursera - Algorithms part 1 (2013)
magnet:?xt=urn:btih:0dcf2c97893be74b5b2b8234d1a703990c909b46&dn=Coursera - Algorithms part 1 (2013)
磁力链接详情
Hash值:
0dcf2c97893be74b5b2b8234d1a703990c909b46
点击数:
108
文件大小:
1.18 GB
文件数量:
72
创建日期:
2017-11-9 10:09
最后访问:
2024-6-12 06:17
访问标签:
Coursera
-
Algorithms
part
1
2013
文件列表详情
video/014_3 - 4 - O(n log n) Algorithm for Closest Pair I [Advanced - Optional] (32 min).mp4 36.22 MB
video/060_16 - 3 - Binary Search Tree Basics Part II (30 min).mp4 29.97 MB
video/040_9 - 4 - Analysis of Contraction Algorithm (30 min).mp4 29.87 MB
video/048_10 - 7 - Computing Strong Components The Algorithm (29 min).mp4 29.5 MB
video/049_10 - 8 - Computing Strong Components The Analysis (26 min).mp4 26.77 MB
video/054_11 - 4 - Dijkstras Algorithm Implementation and Running Time (26 min).mp4 26.46 MB
video/068_14 - 2 - Universal Hashing Definition and Example [Advanced - Optional] (26 min).mp4 26.15 MB
video/029_7 - 1 - Part I [Review - Optional] (25 min).mp4 25.42 MB
video/023_5 - 2 - Partitioning Around a Pivot (25 min).mp4 24.84 MB
video/013_3 - 3 - Strassens Subcubic Matrix Multiplication Algorithm (22 min).mp4 23.57 MB
video/042_10 - 1 - Graph Search - Overview (23 min).mp4 23.25 MB
video/034_8 - 4 - Deterministic Selection - Analysis I [Advanced - Optional] (22 min).mp4 22.82 MB
video/066_13 - 3 - Hash Tables Implementation Details Part II (22 min).mp4 22.53 MB
video/067_14 - 1 - Pathological Data Sets and Universal Hashing Motivation (22 min).mp4 22.49 MB
video/047_10 - 6 - Topological Sort (22 min).mp4 22.08 MB
video/061_16 - 4 - Red-Black Trees (21 min).mp4 21.83 MB
video/025_5 - 4 - Choosing a Good Pivot (22min).mp4 21.74 MB
video/026_6 - 1 - Analysis I A Decomposition Principle [Advanced - Optional] (22 min).mp4 21.65 MB
video/031_8 - 1 - Randomized Selection - Algorithm (22 min).mp4 21.4 MB
video/051_11 - 1 - Dijkstras Shortest-Path Algorithm (21 min).mp4 20.96 MB
video/057_12 - 3 - Heaps Implementation Details [Advanced - Optional] (21 min).mp4 20.92 MB
video/063_16 - 6 - Insertion in a Red-Black Tree [Advanced] (15 min).mp4 20.78 MB
video/032_8 - 2 - Randomized Selection - Analysis (21 min).mp4 20.62 MB
video/053_11 - 3 - Correctness of Dijkstras Algorithm [Advanced - Optional] (19 min).mp4 20.31 MB
video/015_3 - 5 - O(n log n) Algorithm for Closest Pair II [Advanced - Optional] (19 min).mp4 20.14 MB
video/065_13 - 2 - Hash Tables Implementation Details Part I (19 min).mp4 19.88 MB
video/064_13 - 1 - Hash Tables Operations and Applications (19 min).mp4 19.73 MB
video/001_1 - 1 - Introduction Why Study Algorithms (19 min).mp4 19.14 MB
video/050_10 - 9 - Structure of the Web [Optional] (19 min).mp4 18.63 MB
video/056_12 - 2 - Heaps Operations and Applications (18 min).mp4 18.62 MB
video/069_14 - 3 - Universal Hashing Analysis of Chaining [Advanced - Optional] (19 min).mp4 18.46 MB
video/006_1 - 6 - Guiding Principles for Analysis of Algorithms (15 min).mp4 17.99 MB
video/033_8 - 3 - Deterministic Selection - Algorithm [Advanced - Optional] (17 min).mp4 17.55 MB
video/002_1 - 2 - About the Course (17 min).mp4 17.37 MB
video/030_7 - 2 - Part II [Review - Optional] (17 min).mp4 17.26 MB
video/012_3 - 2 - O(n log n) Algorithm for Counting Inversions II (17 min).mp4 17.19 MB
video/021_4 - 6 - Proof II (16 min).mp4 16.6 MB
video/038_9 - 2 - Graph Representations (14 min).mp4 15.69 MB
video/070_14 - 4 - Hash Table Performance with Open Addressing [Advanced - Optional] (16 min).mp4 15.6 MB
video/071_15 - 1 - Bloom Filters The Basics (16 min).mp4 15.43 MB
video/037_9 - 1 - Graphs and Minimum Cuts (16 min).mp4 15.21 MB
video/004_1 - 4 - Merge Sort Pseudocode (13 min).mp4 15.01 MB
video/018_4 - 3 - Examples (13 min).mp4 14.4 MB
video/043_10 - 2 - Breadth-First Search (BFS) The Basics (14 min).mp4 14.28 MB
video/045_10 - 4 - BFS and Undirected Connectivity (13 min).mp4 13.7 MB
video/036_8 - 6 - Omega(n log n) Lower Bound for Comparison-Based Sorting [Advanced - Optional] (13 min).mp4 13.68 MB
video/072_15 - 2 - Bloom Filters Heuristic Analysis (13 min).mp4 13.57 MB
video/059_16 - 2 - Binary Search Tree Basics Part I (13 min).mp4 13.28 MB
video/020_4 - 5 - Interpretation of the 3 Cases (11 min).mp4 13.11 MB
video/052_11 - 2 - Dijkstras Algorithm Examples (13 min).mp4 12.88 MB
video/011_3 - 1 - O(n log n) Algorithm for Counting Inversions I (13 min).mp4 12.85 MB
video/035_8 - 5 - Deterministic Selection - Analysis II [Advanced - Optional] (13 min).mp4 12.83 MB
video/022_5 - 1 - Quicksort Overview (12 min).mp4 12.19 MB
video/027_6 - 2 - Analysis II The Key Insight [Advanced - Optional] (12min).mp4 11.98 MB
video/024_5 - 3 - Correctness of Quicksort [Review - Optional] (11 min).mp4 11.82 MB
video/019_4 - 4 - Proof I (10 min).mp4 11.46 MB
video/005_1 - 5 - Merge Sort Analysis (9 min).mp4 11.31 MB
video/058_16 - 1 - Balanced Search Trees Operations and Applications (11 min).mp4 10.99 MB
video/003_1 - 3 - Merge Sort Motivation and Example (9 min).mp4 10.68 MB
video/017_4 - 2 - Formal Statement (10 min).mp4 10.42 MB
video/062_16 - 5 - Rotations [Advanced - Optional] (8 min).mp4 10.32 MB
video/028_6 - 3 - Analysis III Final Calculations [Advanced - Optional] (9min).mp4 8.92 MB
video/039_9 - 3 - Random Contraction Algorithm (9 min).mp4 8.28 MB
video/016_4 - 1 - Motivation (8 min).mp4 8.25 MB
video/044_10 - 3 - BFS and Shortest Paths (8 min).mp4 7.9 MB
video/010_2 - 4 - Additional Examples [Review - Optional] (8 min).mp4 7.72 MB
video/009_2 - 3 - Big Omega and Theta (7 min).mp4 7.49 MB
video/041_9 - 5 - Counting Minimum Cuts (7 min).mp4 7.41 MB
video/008_2 - 2 - Basic Examples (7 min).mp4 7.3 MB
video/046_10 - 5 - Depth-First Search (DFS) The Basics (7 min).mp4 7.16 MB
video/055_12 - 1 - Data Structures Overview (5 min).mp4 4.66 MB
video/007_2 - 1 - Big-Oh Notation (4 min).mp4 4.13 MB
其他位置