[Coursera] Algorithms II

BT种子名称

请保存以下最新地址

BT种子基本信息

种子哈希：249012dfc0704687885bbe4235481a5501fa52e1
文档大小：1.6 GB
文档个数：132个文档
下载次数：4112次
下载速度：极快
收录时间：2020-02-29
最近下载：2025-01-19
DMCA/屏蔽：DMCA/屏蔽

下载磁力链接

magnet:?xt=urn:btih:249012DFC0704687885BBE4235481A5501FA52E1
复制磁力链接到PikPak、utorrent、Bitcomet、迅雷、115、百度网盘等下载工具进行下载。

下载BT种子

磁力链接种子下载迅雷下载二维码 YouTube成人版 91视频 91短视频 51品茶逼哩逼哩萝莉岛欲漫涩草榴社区含羞草抖阴破解版 TikTok成人版成人快手乱伦社区 91AV 暗网禁地

文档列表

9 - 3 - Knuth-Morris-Pratt (33_14).mp4 47.2 MB
4 - 5 - Prim's Algorithm (33_15).mp4 44.3 MB
8 - 1 - R-way Tries (32_19).mp4 42.9 MB
11 - 4 - LZW Compression (27_33).mp4 38.9 MB
2 - 3 - Depth-First Search (26_22).mp4 38.8 MB
11 - 1 - Introduction to Data Compression (22_27).mp4 37.8 MB
14 - 1 - Introduction to Intractability (17_00).mp4 36.2 MB
11 - 3 - Huffman Compression (24_14).mp4 35.7 MB
6 - 6 - Maxflow Applications (22_20).mp4 35.6 MB
10 - 5 - Regular Expression Applications (20_09).mp4 35.4 MB
8 - 3 - Character-Based Operations (20_03).mp4 34.3 MB
14 - 5 - NP-Completeness (12_38).mp4 33.3 MB
10 - 1 - Regular Expressions (20_03).mp4 32.3 MB
13 - 1 - Brewer's Problem (21_15).mp4 32.0 MB
13 - 3 - Simplex Implementations (16_21).mp4 31.5 MB
14 - 3 - P vs. NP (16_29).mp4 31.4 MB
7 - 6 - Suffix Arrays (19_25).mp4 31.1 MB
8 - 2 - Ternary Search Tries (22_42).mp4 30.7 MB
5 - 3 - Dijkstra's Algorithm (18_58).mp4 29.5 MB
5 - 5 - Negative Weights (21_01).mp4 29.2 MB
7 - 3 - LSD Radix Sort (15_00).mp4 29.0 MB
3 - 3 - Digraph Search (20_56).mp4 28.9 MB
5 - 4 - Edge-Weighted DAGs (19_23).mp4 27.8 MB
3 - 5 - Strong Components (20_22).mp4 27.3 MB
7 - 1 - Strings in Java (17_43).mp4 26.6 MB
2 - 5 - Connected Components (18_56).mp4 26.0 MB
9 - 5 - Rabin-Karp (16_13).mp4 25.8 MB
2 - 6 - Graph Challenges (14_29).mp4 25.5 MB
10 - 3 - NFA Simulation (18_27).mp4 25.0 MB
14 - 6 - Coping with Intractability (14_01).mp4 22.7 MB
14 - 4 - Classifying Problems (13_43).mp4 22.4 MB
14 - 2 - Search Problems (10_56).mp4 22.3 MB
13 - 4 - Linear Programming Reductions (11_46).mp4 21.8 MB
2 - 2 - Graph API (14_47).mp4 21.6 MB
5 - 2 - Shortest Path Properties (14_46).mp4 20.7 MB
6 - 5 - Java Implementation (14_29).mp4 20.1 MB
2 - 4 - Breadth-First Search (13_34).mp4 20.0 MB
10 - 2 - REs and NFAs (13_14).mp4 20.0 MB
7 - 4 - MSD Radix Sort (13_41).mp4 20.0 MB
12 - 4 - Classifying Problems (12_45).mp4 19.4 MB
4 - 2 - Greedy Algorithm (12_56).mp4 19.2 MB
12 - 1 - Introduction to Reductions (9_25).mp4 18.3 MB
3 - 4 - Topological Sort (12_54).mp4 17.7 MB
4 - 4 - Kruskal's Algorithm (12_28).mp4 17.7 MB
7 - 2 - Key-Indexed Counting (12_06).mp4 17.6 MB
10 - 4 - NFA Construction (11_42).mp4 17.4 MB
12 - 3 - Establishing Lower Bounds (9_16).mp4 17.3 MB
4 - 6 - MST Context (10_34).mp4 17.2 MB
13 - 2 - Simplex Algorithm (11_49).mp4 16.9 MB
5 - 1 - Shortest Paths APIs (10_51).mp4 16.4 MB
1 - 1 - Course Introduction (9_22).mp4 16.4 MB
4 - 3 - Edge-Weighted Graph API (11_15).mp4 15.9 MB
6 - 1 - Introduction to Maxflow (10_33).mp4 15.7 MB
2 - 1 - Introduction to Graphs (9_32).mp4 15.3 MB
9 - 2 - Brute-Force Substring Search (10_11).mp4 14.8 MB
3 - 1 - Introduction to Digraphs (8_30).mp4 14.0 MB
6 - 3 - Maxflow-Mincut Theorem (9_38).mp4 13.4 MB
6 - 4 - Running Time Analysis (8_49).mp4 13.3 MB
9 - 4 - Boyer-Moore (8_36).mp4 12.6 MB
7 - 5 - 3-way Radix Quicksort (7_22).mp4 12.5 MB
12 - 2 - Designing Algorithms (8_13).mp4 12.4 MB
11 - 2 - Run-Length Coding (5_59).mp4 9.6 MB
9 - 1 - Introduction to Substring Search (6_42).mp4 9.5 MB
6 - 2 - Ford-Fulkerson Algorithm (6_32).mp4 8.9 MB
3 - 2 - Digraph API (4_56).mp4 7.6 MB
4 - 1 - Introduction to MSTs (4_04).mp4 7.1 MB
4 - 5 - Prim's Algorithm (33_15).srt 39.9 kB
9 - 3 - Knuth-Morris-Pratt (33_14).srt 39.1 kB
8 - 1 - R-way Tries (32_19).srt 38.9 kB
2 - 3 - Depth-First Search (26_22).srt 31.8 kB
11 - 4 - LZW Compression (27_33).srt 28.4 kB
11 - 3 - Huffman Compression (24_14).srt 27.0 kB
8 - 2 - Ternary Search Tries (22_42).srt 26.4 kB
6 - 6 - Maxflow Applications (22_20).srt 26.1 kB
11 - 1 - Introduction to Data Compression (22_27).srt 26.1 kB
5 - 5 - Negative Weights (21_01).srt 24.5 kB
3 - 5 - Strong Components (20_22).srt 24.4 kB
13 - 1 - Brewer's Problem (21_15).srt 23.5 kB
5 - 4 - Edge-Weighted DAGs (19_23).srt 23.4 kB
10 - 1 - Regular Expressions (20_03).srt 23.4 kB
5 - 3 - Dijkstra's Algorithm (18_58).srt 23.1 kB
7 - 6 - Suffix Arrays (19_25).srt 23.0 kB
2 - 5 - Connected Components (18_56).srt 22.9 kB
3 - 3 - Digraph Search (20_56).srt 22.9 kB
10 - 5 - Regular Expression Applications (20_09).srt 22.1 kB
8 - 3 - Character-Based Operations (20_03).srt 22.1 kB
7 - 1 - Strings in Java (17_43).srt 21.9 kB
14 - 1 - Introduction to Intractability (17_00).srt 20.4 kB
10 - 3 - NFA Simulation (18_27).srt 20.3 kB
14 - 3 - P vs. NP (16_29).srt 18.5 kB
13 - 3 - Simplex Implementations (16_21).srt 18.4 kB
7 - 3 - LSD Radix Sort (15_00).srt 18.2 kB
9 - 5 - Rabin-Karp (16_13).srt 17.3 kB
2 - 6 - Graph Challenges (14_29).srt 17.3 kB
2 - 2 - Graph API (14_47).srt 16.9 kB
6 - 5 - Java Implementation (14_29).srt 16.6 kB
5 - 2 - Shortest Path Properties (14_46).srt 16.3 kB
4 - 2 - Greedy Algorithm (12_56).srt 16.2 kB
7 - 4 - MSD Radix Sort (13_41).srt 16.2 kB
2 - 4 - Breadth-First Search (13_34).srt 16.1 kB
10 - 2 - REs and NFAs (13_14).srt 15.7 kB
3 - 4 - Topological Sort (12_54).srt 15.0 kB
14 - 4 - Classifying Problems (13_43).srt 14.9 kB
12 - 4 - Classifying Problems (12_45).srt 14.4 kB
14 - 6 - Coping with Intractability (14_01).srt 14.4 kB
4 - 4 - Kruskal's Algorithm (12_28).srt 14.3 kB
14 - 5 - NP-Completeness (12_38).srt 14.2 kB
13 - 4 - Linear Programming Reductions (11_46).srt 13.5 kB
5 - 1 - Shortest Paths APIs (10_51).srt 13.5 kB
6 - 1 - Introduction to Maxflow (10_33).srt 13.3 kB
7 - 2 - Key-Indexed Counting (12_06).srt 13.3 kB
1 - 1 - Course Introduction (9_22).srt 13.1 kB
14 - 2 - Search Problems (10_56).srt 13.0 kB
10 - 4 - NFA Construction (11_42).srt 12.6 kB
12 - 1 - Introduction to Reductions (9_25).srt 12.1 kB
4 - 3 - Edge-Weighted Graph API (11_15).srt 12.1 kB
13 - 2 - Simplex Algorithm (11_49).srt 12.1 kB
9 - 2 - Brute-Force Substring Search (10_11).srt 12.0 kB
4 - 6 - MST Context (10_34).srt 11.8 kB
2 - 1 - Introduction to Graphs (9_32).srt 11.7 kB
6 - 3 - Maxflow-Mincut Theorem (9_38).srt 11.2 kB
12 - 3 - Establishing Lower Bounds (9_16).srt 10.8 kB
3 - 1 - Introduction to Digraphs (8_30).srt 10.5 kB
6 - 4 - Running Time Analysis (8_49).srt 10.1 kB
9 - 4 - Boyer-Moore (8_36).srt 9.9 kB
12 - 2 - Designing Algorithms (8_13).srt 9.7 kB
7 - 5 - 3-way Radix Quicksort (7_22).srt 8.4 kB
9 - 1 - Introduction to Substring Search (6_42).srt 7.9 kB
6 - 2 - Ford-Fulkerson Algorithm (6_32).srt 7.7 kB
11 - 2 - Run-Length Coding (5_59).srt 6.5 kB
3 - 2 - Digraph API (4_56).srt 5.4 kB
4 - 1 - Introduction to MSTs (4_04).srt 4.5 kB

==查看完整文档列表==

下一个：LuXuShuei.m4v 1.5 GB