种子简介

种子名称： [Coursera] Algorithms II
文件类型：
文件数目： 66个文件
文件大小： 1.45 GB
收录时间： 2014-8-20 05:05
已经下载： 3次
资源热度： 181
最近下载： 2024-5-10 09:14

下载BT种子文件

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

磁力链接下载

magnet:?xt=urn:btih:249012DFC0704687885BBE4235481A5501FA52E1&dn=[Coursera] Algorithms II 复制链接到迅雷、QQ旋风进行下载，或者使用百度云离线下载。

喜欢这个种子的人也喜欢

种子包含的文件

[Coursera] Algorithms II.torrent

9 - 3 - Knuth-Morris-Pratt (33_14).mp445.04MB

4 - 5 - Prim's Algorithm (33_15).mp442.28MB

8 - 1 - R-way Tries (32_19).mp440.89MB

11 - 4 - LZW Compression (27_33).mp437.15MB

2 - 3 - Depth-First Search (26_22).mp436.97MB

11 - 1 - Introduction to Data Compression (22_27).mp436.04MB

14 - 1 - Introduction to Intractability (17_00).mp434.49MB

11 - 3 - Huffman Compression (24_14).mp434.02MB

6 - 6 - Maxflow Applications (22_20).mp433.91MB

10 - 5 - Regular Expression Applications (20_09).mp433.8MB

8 - 3 - Character-Based Operations (20_03).mp432.72MB

14 - 5 - NP-Completeness (12_38).mp431.8MB

10 - 1 - Regular Expressions (20_03).mp430.83MB

13 - 1 - Brewer's Problem (21_15).mp430.55MB

13 - 3 - Simplex Implementations (16_21).mp430.05MB

14 - 3 - P vs. NP (16_29).mp429.95MB

7 - 6 - Suffix Arrays (19_25).mp429.63MB

8 - 2 - Ternary Search Tries (22_42).mp429.27MB

5 - 3 - Dijkstra's Algorithm (18_58).mp428.09MB

5 - 5 - Negative Weights (21_01).mp427.84MB

7 - 3 - LSD Radix Sort (15_00).mp427.68MB

3 - 3 - Digraph Search (20_56).mp427.59MB

5 - 4 - Edge-Weighted DAGs (19_23).mp426.49MB

3 - 5 - Strong Components (20_22).mp426.06MB

7 - 1 - Strings in Java (17_43).mp425.38MB

2 - 5 - Connected Components (18_56).mp424.75MB

9 - 5 - Rabin-Karp (16_13).mp424.58MB

2 - 6 - Graph Challenges (14_29).mp424.32MB

10 - 3 - NFA Simulation (18_27).mp423.88MB

14 - 6 - Coping with Intractability (14_01).mp421.66MB

14 - 4 - Classifying Problems (13_43).mp421.37MB

14 - 2 - Search Problems (10_56).mp421.23MB

13 - 4 - Linear Programming Reductions (11_46).mp420.79MB

2 - 2 - Graph API (14_47).mp420.58MB

5 - 2 - Shortest Path Properties (14_46).mp419.77MB

6 - 5 - Java Implementation (14_29).mp419.15MB

2 - 4 - Breadth-First Search (13_34).mp419.07MB

10 - 2 - REs and NFAs (13_14).mp419.06MB

7 - 4 - MSD Radix Sort (13_41).mp419.04MB

12 - 4 - Classifying Problems (12_45).mp418.52MB

4 - 2 - Greedy Algorithm (12_56).mp418.29MB

12 - 1 - Introduction to Reductions (9_25).mp417.45MB

3 - 4 - Topological Sort (12_54).mp416.88MB

4 - 4 - Kruskal's Algorithm (12_28).mp416.87MB

7 - 2 - Key-Indexed Counting (12_06).mp416.76MB

10 - 4 - NFA Construction (11_42).mp416.56MB

12 - 3 - Establishing Lower Bounds (9_16).mp416.45MB

4 - 6 - MST Context (10_34).mp416.42MB

13 - 2 - Simplex Algorithm (11_49).mp416.12MB

5 - 1 - Shortest Paths APIs (10_51).mp415.67MB

1 - 1 - Course Introduction (9_22).mp415.6MB

4 - 3 - Edge-Weighted Graph API (11_15).mp415.12MB

6 - 1 - Introduction to Maxflow (10_33).mp414.99MB

2 - 1 - Introduction to Graphs (9_32).mp414.57MB

9 - 2 - Brute-Force Substring Search (10_11).mp414.13MB

3 - 1 - Introduction to Digraphs (8_30).mp413.31MB

6 - 3 - Maxflow-Mincut Theorem (9_38).mp412.78MB

6 - 4 - Running Time Analysis (8_49).mp412.67MB

9 - 4 - Boyer-Moore (8_36).mp412.01MB

7 - 5 - 3-way Radix Quicksort (7_22).mp411.91MB

12 - 2 - Designing Algorithms (8_13).mp411.87MB

11 - 2 - Run-Length Coding (5_59).mp49.11MB

9 - 1 - Introduction to Substring Search (6_42).mp49.04MB

6 - 2 - Ford-Fulkerson Algorithm (6_32).mp48.51MB

3 - 2 - Digraph API (4_56).mp47.21MB

4 - 1 - Introduction to MSTs (4_04).mp46.76MB