磁力狗
导航切换
首页
最新地址
最新地址
最新地址
最新地址
搜索磁力
BT种子名称
Coursera - Algorithms part 1 (2013)
请保存以下最新地址
clgou.icu
clgougou.cyou
clg.dog
磁力.dog
BT种子基本信息
种子哈希:
0dcf2c97893be74b5b2b8234d1a703990c909b46
文档大小:
1.3 GB
文档个数:
199
个文档
下载次数:
12992
次
下载速度:
极快
收录时间:
2020-02-20
最近下载:
2025-01-02
DMCA/屏蔽:
DMCA/屏蔽
下载磁力链接
magnet:?xt=urn:btih:0DCF2C97893BE74B5B2B8234D1A703990C909B46
复制磁力链接到
PikPak
、utorrent、Bitcomet、迅雷、115、百度网盘等下载工具进行下载。
下载BT种子
磁力链接
种子下载
迅雷下载
二维码
YouTube成人版
91视频
91短视频
51品茶
逼哩逼哩
萝莉岛
欲漫涩
草榴社区
含羞草
抖阴破解版
TikTok成人版
成人快手
乱伦社区
91AV
暗网禁地
文档列表
video/014_3 - 4 - O(n log n) Algorithm for Closest Pair I [Advanced - Optional] (32 min).mp4
38.0 MB
video/060_16 - 3 - Binary Search Tree Basics Part II (30 min).mp4
31.4 MB
video/040_9 - 4 - Analysis of Contraction Algorithm (30 min).mp4
31.3 MB
video/048_10 - 7 - Computing Strong Components The Algorithm (29 min).mp4
30.9 MB
video/049_10 - 8 - Computing Strong Components The Analysis (26 min).mp4
28.1 MB
video/054_11 - 4 - Dijkstras Algorithm Implementation and Running Time (26 min).mp4
27.7 MB
video/068_14 - 2 - Universal Hashing Definition and Example [Advanced - Optional] (26 min).mp4
27.4 MB
video/029_7 - 1 - Part I [Review - Optional] (25 min).mp4
26.7 MB
video/023_5 - 2 - Partitioning Around a Pivot (25 min).mp4
26.1 MB
video/013_3 - 3 - Strassens Subcubic Matrix Multiplication Algorithm (22 min).mp4
24.7 MB
video/042_10 - 1 - Graph Search - Overview (23 min).mp4
24.4 MB
video/034_8 - 4 - Deterministic Selection - Analysis I [Advanced - Optional] (22 min).mp4
23.9 MB
video/066_13 - 3 - Hash Tables Implementation Details Part II (22 min).mp4
23.6 MB
video/067_14 - 1 - Pathological Data Sets and Universal Hashing Motivation (22 min).mp4
23.6 MB
video/047_10 - 6 - Topological Sort (22 min).mp4
23.2 MB
video/061_16 - 4 - Red-Black Trees (21 min).mp4
22.9 MB
video/025_5 - 4 - Choosing a Good Pivot (22min).mp4
22.8 MB
video/026_6 - 1 - Analysis I A Decomposition Principle [Advanced - Optional] (22 min).mp4
22.7 MB
video/031_8 - 1 - Randomized Selection - Algorithm (22 min).mp4
22.4 MB
video/051_11 - 1 - Dijkstras Shortest-Path Algorithm (21 min).mp4
22.0 MB
video/057_12 - 3 - Heaps Implementation Details [Advanced - Optional] (21 min).mp4
21.9 MB
video/063_16 - 6 - Insertion in a Red-Black Tree [Advanced] (15 min).mp4
21.8 MB
video/032_8 - 2 - Randomized Selection - Analysis (21 min).mp4
21.6 MB
video/053_11 - 3 - Correctness of Dijkstras Algorithm [Advanced - Optional] (19 min).mp4
21.3 MB
video/015_3 - 5 - O(n log n) Algorithm for Closest Pair II [Advanced - Optional] (19 min).mp4
21.1 MB
video/065_13 - 2 - Hash Tables Implementation Details Part I (19 min).mp4
20.8 MB
video/064_13 - 1 - Hash Tables Operations and Applications (19 min).mp4
20.7 MB
video/001_1 - 1 - Introduction Why Study Algorithms (19 min).mp4
20.1 MB
video/050_10 - 9 - Structure of the Web [Optional] (19 min).mp4
19.5 MB
video/056_12 - 2 - Heaps Operations and Applications (18 min).mp4
19.5 MB
video/069_14 - 3 - Universal Hashing Analysis of Chaining [Advanced - Optional] (19 min).mp4
19.4 MB
video/006_1 - 6 - Guiding Principles for Analysis of Algorithms (15 min).mp4
18.9 MB
video/033_8 - 3 - Deterministic Selection - Algorithm [Advanced - Optional] (17 min).mp4
18.4 MB
video/002_1 - 2 - About the Course (17 min).mp4
18.2 MB
video/030_7 - 2 - Part II [Review - Optional] (17 min).mp4
18.1 MB
video/012_3 - 2 - O(n log n) Algorithm for Counting Inversions II (17 min).mp4
18.0 MB
video/021_4 - 6 - Proof II (16 min).mp4
17.4 MB
video/038_9 - 2 - Graph Representations (14 min).mp4
16.4 MB
video/070_14 - 4 - Hash Table Performance with Open Addressing [Advanced - Optional] (16 min).mp4
16.4 MB
video/071_15 - 1 - Bloom Filters The Basics (16 min).mp4
16.2 MB
video/037_9 - 1 - Graphs and Minimum Cuts (16 min).mp4
15.9 MB
video/004_1 - 4 - Merge Sort Pseudocode (13 min).mp4
15.7 MB
video/018_4 - 3 - Examples (13 min).mp4
15.1 MB
video/043_10 - 2 - Breadth-First Search (BFS) The Basics (14 min).mp4
15.0 MB
video/045_10 - 4 - BFS and Undirected Connectivity (13 min).mp4
14.4 MB
video/036_8 - 6 - Omega(n log n) Lower Bound for Comparison-Based Sorting [Advanced - Optional] (13 min).mp4
14.3 MB
video/072_15 - 2 - Bloom Filters Heuristic Analysis (13 min).mp4
14.2 MB
video/059_16 - 2 - Binary Search Tree Basics Part I (13 min).mp4
13.9 MB
video/020_4 - 5 - Interpretation of the 3 Cases (11 min).mp4
13.8 MB
video/052_11 - 2 - Dijkstras Algorithm Examples (13 min).mp4
13.5 MB
video/011_3 - 1 - O(n log n) Algorithm for Counting Inversions I (13 min).mp4
13.5 MB
video/035_8 - 5 - Deterministic Selection - Analysis II [Advanced - Optional] (13 min).mp4
13.5 MB
video/022_5 - 1 - Quicksort Overview (12 min).mp4
12.8 MB
video/027_6 - 2 - Analysis II The Key Insight [Advanced - Optional] (12min).mp4
12.6 MB
video/024_5 - 3 - Correctness of Quicksort [Review - Optional] (11 min).mp4
12.4 MB
video/019_4 - 4 - Proof I (10 min).mp4
12.0 MB
video/005_1 - 5 - Merge Sort Analysis (9 min).mp4
11.9 MB
video/058_16 - 1 - Balanced Search Trees Operations and Applications (11 min).mp4
11.5 MB
video/003_1 - 3 - Merge Sort Motivation and Example (9 min).mp4
11.2 MB
video/017_4 - 2 - Formal Statement (10 min).mp4
10.9 MB
video/062_16 - 5 - Rotations [Advanced - Optional] (8 min).mp4
10.8 MB
video/028_6 - 3 - Analysis III Final Calculations [Advanced - Optional] (9min).mp4
9.4 MB
video/039_9 - 3 - Random Contraction Algorithm (9 min).mp4
8.7 MB
video/016_4 - 1 - Motivation (8 min).mp4
8.7 MB
video/044_10 - 3 - BFS and Shortest Paths (8 min).mp4
8.3 MB
video/010_2 - 4 - Additional Examples [Review - Optional] (8 min).mp4
8.1 MB
video/009_2 - 3 - Big Omega and Theta (7 min).mp4
7.9 MB
video/041_9 - 5 - Counting Minimum Cuts (7 min).mp4
7.8 MB
video/008_2 - 2 - Basic Examples (7 min).mp4
7.7 MB
video/046_10 - 5 - Depth-First Search (DFS) The Basics (7 min).mp4
7.5 MB
video/055_12 - 1 - Data Structures Overview (5 min).mp4
4.9 MB
video/007_2 - 1 - Big-Oh Notation (4 min).mp4
4.3 MB
slides/015_algo-closest2_typed.pdf
4.1 MB
slides/023_algo-qsort-partition_typed.pdf
4.1 MB
slides/043_algo-graphs-bfs_typed.pdf
2.8 MB
slides/034_algo-select-danalysis_typed.pdf
2.3 MB
slides/044_algo-graphs-dfs_typed.pdf
2.2 MB
slides/014_algo-closest1_typed.pdf
2.2 MB
slides/032_algo-select-ranalysis_typed.pdf
2.1 MB
slides/042_algo-graphs-search_typed.pdf
2.1 MB
slides/031_algo-select-ralgorithm_typed.pdf
2.0 MB
slides/013_algo-strassen_typed.pdf
1.9 MB
slides/033_algo-select-dalgorithm_typed.pdf
1.8 MB
slides/058_algo-ds-hash-guts_typed.pdf
1.7 MB
slides/029_algo-prob_review1_typed.pdf
1.6 MB
slides/045_algo-graphs-scc_typed.pdf
1.6 MB
slides/025_algo-qsort-pivot_typed.pdf
1.5 MB
slides/026_algo-qsort-analysis1_typed.pdf
1.5 MB
slides/022_algo-qsort-intro_typed.pdf
1.4 MB
slides/030_algo-prob_review2_typed.pdf
1.3 MB
slides/024_algo-qsort-correctness_typed.pdf
1.1 MB
slides/053_algo-ds-heaps-guts_typed.pdf
1.1 MB
slides/028_algo-qsort-analysis3_typed.pdf
1.0 MB
slides/009_algo-asymptotic3_typed.pdf
1.0 MB
slides/019_algo-master4_typed.pdf
967.0 kB
slides/011_algo-inversions1_typed.pdf
937.1 kB
slides/018_algo-master3_typed.pdf
875.7 kB
slides/021_algo-master6_typed.pdf
845.5 kB
slides/010_algo-asymptotic4_typed.pdf
842.1 kB
slides/007_algo-asymptotic1_typed.pdf
831.5 kB
slides/060_algo-ds-hash-universal-2_typed.pdf
790.4 kB
slides/002_algo-about_typed.pdf
749.0 kB
slides/001_algo-intro_typed.pdf
746.6 kB
slides/005_algo-merge3_typed.pdf
737.8 kB
slides/003_algo-merge1_typed.pdf
713.9 kB
slides/004_algo-merge2_typed.pdf
679.8 kB
slides/039_algo-karger-algorithm_typed.pdf
641.9 kB
slides/040_algo-karger-analysis_typed.pdf
628.0 kB
slides/006_algo-guiding_typed.pdf
567.3 kB
slides/037_algo-karger-overview_typed.pdf
508.6 kB
slides/046_algo-graphs-sccanalysis_typed.pdf
473.5 kB
slides/038_algo-karger-representations_typed.pdf
472.4 kB
slides/055_algo-ds-trees-basics-typed.pdf
468.5 kB
slides/016_algo-master1_typed.pdf
467.6 kB
slides/012_algo-inversions2_typed.pdf
463.2 kB
slides/050_algo-dijkstra-runtime_typed.pdf
453.6 kB
slides/049_algo-dijkstra-correctness_typed.pdf
444.3 kB
slides/048_algo-dijkstra-basics_typed.pdf
443.1 kB
slides/061_algo-ds-hash-universal3-typed.pdf
378.6 kB
slides/017_algo-master2_typed.pdf
370.9 kB
slides/008_algo-asymptotic2_typed.pdf
345.7 kB
slides/035_algo-select-danalysis2_typed.pdf
312.6 kB
slides/027_algo-qsort-analysis2_typed.pdf
308.6 kB
slides/041_algo-karger-counting_typed.pdf
286.2 kB
slides/020_algo-master5_typed.pdf
283.6 kB
slides/036_algo-select-sortinglb_typed.pdf
276.5 kB
slides/056_algo-ds-trees-redblack-typed.pdf
252.6 kB
slides/047_algo-graphs-web_typed.pdf
251.4 kB
slides/057_algo-ds-hash-basics_typed.pdf
229.0 kB
slides/052_algo-ds-heaps-basics_typed.pdf
226.2 kB
slides/051_algo-ds-overview_typed.pdf
197.5 kB
slides/063_algo-ds-bloom-typed.pdf
190.3 kB
slides/062_algo-ds-hash-universal4-typed.pdf
156.1 kB
slides/054_algo-ds-trees-ops-typed.pdf
125.5 kB
slides/059_algo-ds-hash-universal1-typed.pdf
125.1 kB
subtitles/014_3 - 4 - O(n log n) Algorithm for Closest Pair I [Advanced - Optional] (32 min).srt
53.2 kB
subtitles/060_16 - 3 - Binary Search Tree Basics, Part II (30 min).srt
48.7 kB
subtitles/048_10 - 7 - Computing Strong Components_ The Algorithm (29 min).srt
47.3 kB
subtitles/040_9 - 4 - Analysis of Contraction Algorithm (30 min).srt
43.6 kB
subtitles/029_7 - 1 - Part I [Review - Optional] (25 min).srt
41.9 kB
subtitles/054_11 - 4 - Dijkstra's Algorithm_ Implementation and Running Time (26 min).srt
41.5 kB
subtitles/049_10 - 8 - Computing Strong Components_ The Analysis (26 min).srt
40.4 kB
subtitles/042_10 - 1 - Graph Search - Overview (23 min).srt
39.0 kB
subtitles/023_5 - 2 - Partitioning Around a Pivot (25 min).srt
37.6 kB
subtitles/031_8 - 1 - Randomized Selection - Algorithm (22 min).srt
36.4 kB
subtitles/061_16 - 4 - Red-Black Trees (21 min).srt
36.1 kB
subtitles/025_5 - 4 - Choosing a Good Pivot (22min).srt
35.8 kB
subtitles/026_6 - 1 - Analysis I_ A Decomposition Principle [Advanced - Optional] (22 min).srt
34.1 kB
subtitles/047_10 - 6 - Topological Sort (22 min).srt
33.9 kB
subtitles/057_12 - 3 - Heaps_ Implementation Details [Advanced - Optional] (21 min).srt
33.5 kB
subtitles/034_8 - 4 - Deterministic Selection - Analysis I [Advanced - Optional] (22 min).srt
33.5 kB
subtitles/051_11 - 1 - Dijkstra's Shortest-Path Algorithm (21 min).srt
32.9 kB
subtitles/013_3 - 3 - Strassen's Subcubic Matrix Multiplication Algorithm (22 min).srt
32.1 kB
subtitles/032_8 - 2 - Randomized Selection - Analysis (21 min).srt
32.0 kB
subtitles/002_1 - 2 - About the Course (17 min).srt
30.9 kB
subtitles/050_10 - 9 - Structure of the Web [Optional] (19 min).srt
30.1 kB
subtitles/015_3 - 5 - O(n log n) Algorithm for Closest Pair II [Advanced - Optional] (19 min).srt
29.8 kB
subtitles/056_12 - 2 - Heaps_ Operations and Applications (18 min).srt
29.3 kB
subtitles/033_8 - 3 - Deterministic Selection - Algorithm [Advanced - Optional] (17 min).srt
28.5 kB
subtitles/001_1 - 1 - Introduction _ Why Study Algorithms.srt
28.4 kB
subtitles/053_11 - 3 - Correctness of Dijkstra's Algorithm [Advanced - Optional] (19 min).srt
28.0 kB
subtitles/012_3 - 2 - O(n log n) Algorithm for Counting Inversions II (17 min).srt
27.9 kB
subtitles/006_1 - 6 - Guiding Principles for Analysis of Algorithms (15 min).srt
25.1 kB
subtitles/021_4 - 6 - Proof II (16 min).srt
25.0 kB
subtitles/030_7 - 2 - Part II [Review - Optional] (17 min).srt
25.0 kB
subtitles/037_9 - 1 - Graphs and Minimum Cuts (16 min).srt
24.4 kB
subtitles/036_8 - 6 - Omega(n log n) Lower Bound for Comparison-Based Sorting [Advanced - Optional] (13 min).srt
22.8 kB
subtitles/043_10 - 2 - Breadth-First Search (BFS)_ The Basics (14 min).srt
22.8 kB
subtitles/045_10 - 4 - BFS and Undirected Connectivity (13 min).srt
22.6 kB
subtitles/038_9 - 2 - Graph Representations (14 min).srt
22.3 kB
subtitles/059_16 - 2 - Binary Search Tree Basics, Part I (13 min).srt
21.4 kB
subtitles/035_8 - 5 - Deterministic Selection - Analysis II [Advanced - Optional] (13 min).srt
20.9 kB
subtitles/004_1 - 4 - Merge Sort_ Pseudocode (13 min).srt
20.7 kB
subtitles/011_3 - 1 - O(n log n) Algorithm for Counting Inversions I (13 min).srt
20.6 kB
subtitles/072_15 - 2 - Bloom Filters_ Heuristic Analysis (13 min).srt
20.4 kB
subtitles/063_16 - 6 - Insertion in a Red-Black Tree [Advanced] (15 min).srt
20.2 kB
subtitles/018_4 - 3 - Examples (13 min).srt
19.6 kB
subtitles/052_11 - 2 - Dijkstra's Algorithm_ Examples (13 min).srt
19.3 kB
subtitles/022_5 - 1 - Quicksort_ Overview (12 min).srt
18.2 kB
subtitles/027_6 - 2 - Analysis II_ The Key Insight [Advanced - Optional] (12min).srt
17.8 kB
subtitles/020_4 - 5 - Interpretation of the 3 Cases (11 min).srt
17.6 kB
subtitles/058_16 - 1 - Balanced Search Trees_ Operations and Applications (11 min).srt
17.3 kB
subtitles/019_4 - 4 - Proof I (10 min).srt
15.7 kB
subtitles/017_4 - 2 - Formal Statement (10 min).srt
14.8 kB
subtitles/024_5 - 3 - Correctness of Quicksort [Review - Optional] (11 min).srt
14.3 kB
subtitles/005_1 - 5 - Merge Sort_ Analysis (9 min).srt
14.2 kB
subtitles/039_9 - 3 - Random Contraction Algorithm (9 min).srt
13.9 kB
subtitles/003_1 - 3 - Merge Sort_ Motivation and Example (9 min).srt
13.5 kB
subtitles/016_4 - 1 - Motivation (8 min).srt
12.6 kB
subtitles/046_10 - 5 - Depth-First Search (DFS)_ The Basics (7 min).srt
12.6 kB
subtitles/028_6 - 3 - Analysis III_ Final Calculations [Advanced - Optional] (9min).srt
12.4 kB
subtitles/010_2 - 4 - Additional Examples [Review - Optional] (8 min).srt
12.3 kB
subtitles/044_10 - 3 - BFS and Shortest Paths (8 min).srt
12.1 kB
subtitles/009_2 - 3 - Big Omega and Theta (7 min).srt
12.0 kB
subtitles/008_2 - 2 - Basic Examples (7 min).srt
11.3 kB
subtitles/062_16 - 5 - Rotations [Advanced - Optional] (8 min).srt
9.9 kB
subtitles/041_9 - 5 - Counting Minimum Cuts (7 min).srt
9.8 kB
subtitles/055_12 - 1 - Data Structures_ Overview (5 min).srt
7.4 kB
subtitles/007_2 - 1 - Big-Oh Notation (4 min).srt
6.5 kB
==查看完整文档列表==
下一个:
Hellraiser Judgment (2018) [1080p] [YTS.ME]
1.3 GB
猜你喜欢
[ FreeCourseWeb.com ] Hands-On Deep Learning Algorithms...
60.7 MB
40 Algorithms Every Programmer Should Know Hone your...
85.8 MB
[ FreeCourseWeb.com ] 40 Algorithms Every Programmer...
571.5 MB
[ DevCourseWeb.com ] Udemy - Cisco Job Interview...
206.5 MB
Bertaccini M. Cryptography Algorithms. Explore New...
65.0 MB
[DesireCourse.Com] Udemy - Algorithms and Data Structures in C++
999.7 MB
MIT OCW - 6.006 - Introduction to Algorithms [Video...
2.8 GB
[FreeCourseSite.com] Udemy - Practical Data Structures &...
3.8 GB
Data Structure And Algorithms
424.5 MB
Brian Christian and Tom Griffiths - Algorithms to Live By
342.7 MB