种子简介

种子名称： Coursera- Algorithm Design & Analysis 1
文件类型：
文件数目： 82个文件
文件大小： 1.4 GB
收录时间： 2015-12-14 17:32
已经下载： 3次
资源热度： 130
最近下载： 2024-7-2 03:20

下载BT种子文件

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

磁力链接下载

magnet:?xt=urn:btih:D7BDB6A29702CB5B6E2B082BA08410247A3689B0&dn=Coursera- Algorithm Design & Analysis 1 复制链接到迅雷、QQ旋风进行下载，或者使用百度云离线下载。

喜欢这个种子的人也喜欢

种子包含的文件

Coursera- Algorithm Design & Analysis 1.torrent

1 - 1 - Why Study Algorithms _ (4 min).mp47.98MB

1 - 2 - Integer Multiplication (9 min).mp416.86MB

1 - 3 - Karatsuba Multiplication (13 min).mp421.66MB

1 - 4 - About the Course (17 min).mp417.37MB

1 - 5 - Merge Sort_ Motivation and Example (9 min).mp410.68MB

1 - 6 - Merge Sort_ Pseudocode (13 min).mp415.01MB

1 - 7 - Merge Sort_ Analysis (9 min).mp411.31MB

1 - 8 - Guiding Principles for Analysis of Algorithms (15 min).mp417.99MB

10 - 1 - Graph Search - Overview (23 min).mp423.25MB

10 - 2 - Breadth-First Search (BFS)_ The Basics (14 min).mp414.28MB

10 - 3 - BFS and Shortest Paths (8 min).mp47.9MB

10 - 4 - BFS and Undirected Connectivity (13 min).mp413.7MB

10 - 5 - Depth-First Search (DFS)_ The Basics (7 min).mp47.16MB

10 - 6 - Topological Sort (22 min).mp422.08MB

10 - 7 - Computing Strong Components_ The Algorithm (29 min).mp429.5MB

10 - 8 - Computing Strong Components_ The Analysis (26 min).mp426.77MB

10 - 9 - Structure of the Web [Optional] (19 min).mp418.63MB

11 - 1 - Dijkstra_'s Shortest-Path Algorithm (21 min).mp420.96MB

11 - 2 - Dijkstra_'s Algorithm_ Examples (13 min).mp412.88MB

11 - 3 - Correctness of Dijkstra_'s Algorithm [Advanced - Optional] (19 min).mp420.31MB

11 - 4 - Dijkstra_'s Algorithm_ Implementation and Running Time (26 min).mp426.46MB

12 - 1 - Data Structures_ Overview (5 min).mp44.66MB

12 - 2 - Heaps_ Operations and Applications (18 min).mp418.62MB

12 - 3 - Heaps_ Implementation Details [Advanced - Optional] (21 min).mp420.92MB

13 - 1 - Balanced Search Trees_ Operations and Applications (11 min).mp410.99MB

13 - 2 - Binary Search Tree Basics, Part I (13 min).mp413.28MB

13 - 3 - Binary Search Tree Basics, Part II (30 min).mp429.97MB

13 - 4 - Red-Black Trees (21 min).mp421.83MB

13 - 5 - Rotations [Advanced - Optional] (8 min).mp410.32MB

13 - 6 - Insertion in a Red-Black Tree [Advanced] (15 min).mp420.78MB

14 - 1 - Hash Tables_ Operations and Applications (19 min).mp419.73MB

14 - 2 - Hash Tables_ Implementation Details, Part I (19 min).mp419.88MB

14 - 3 - Hash Tables_ Implementation Details, Part II (22 min).mp422.53MB

15 - 1 - Pathological Data Sets and Universal Hashing Motivation (22 min).mp422.49MB

15 - 2 - Universal Hashing_ Definition and Example [Advanced - Optional] (26 min).mp426.15MB

15 - 3 - Universal Hashing_ Analysis of Chaining [Advanced - Optional] (19 min).mp418.46MB

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

16 - 1 - Bloom Filters_ The Basics (16 min).mp415.43MB

16 - 2 - Bloom Filters_ Heuristic Analysis (13 min).mp413.57MB

17 - 1 - Application_ Internet Routing [Optional] (11 min).mp413.85MB

17 - 2 - Application_ Sequence Alignment [Optional] (9 min).mp411.1MB

17 - 3 - Introduction to Greedy Algorithms [Optional] (13 min).mp418.04MB

17 - 4 - Huffman Codes_ Introduction and Motivation [Optional] (9 min).mp411.89MB

17 - 5 - Principles of Dynamic Programming [Optional] (8 min).mp412.27MB

17 - 6 - The P vs. NP Question [Optional] (9 min).mp414.28MB

17 - 7 - Algorithmic Approaches to NP-Complete Problems [Optional] (13 min).mp419.86MB

2 - 1 - The Gist (14 min).mp427.68MB

2 - 2 - Big-Oh Notation (4 min).mp44.13MB

2 - 3 - Basic Examples (7 min).mp47.3MB

2 - 4 - Big Omega and Theta (7 min).mp47.49MB

2 - 5 - Additional Examples [Review - Optional] (8 min).mp47.72MB

3 - 1 - O(n log n) Algorithm for Counting Inversions I (13 min).mp412.85MB

3 - 2 - O(n log n) Algorithm for Counting Inversions II (17 min).mp417.19MB

3 - 3 - Strassen_'s Subcubic Matrix Multiplication Algorithm (22 min).mp423.57MB

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

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

4 - 1 - Motivation (8 min).mp48.25MB

4 - 2 - Formal Statement (10 min).mp410.42MB

4 - 3 - Examples (13 min).mp414.4MB

4 - 4 - Proof I (10 min).mp411.46MB

4 - 5 - Interpretation of the 3 Cases (11 min).mp413.11MB

4 - 6 - Proof II (16 min).mp416.6MB

5 - 1 - Quicksort_ Overview (12 min).mp412.19MB

5 - 2 - Partitioning Around a Pivot (25 min).mp424.84MB

5 - 3 - Correctness of Quicksort [Review - Optional] (11 min).mp411.82MB

5 - 4 - Choosing a Good Pivot (22min).mp427.55MB

6 - 1 - Analysis I_ A Decomposition Principle [Advanced - Optional] (22 min).mp421.65MB

6 - 2 - Analysis II_ The Key Insight [Advanced - Optional] (12min).mp411.98MB

6 - 3 - Analysis III_ Final Calculations [Advanced - Optional] (9min).mp48.92MB

7 - 1 - Part I [Review - Optional] (25 min).mp425.42MB

7 - 2 - Part II [Review - Optional] (17 min).mp417.26MB

8 - 1 - Randomized Selection - Algorithm (22 min).mp421.4MB

8 - 2 - Randomized Selection - Analysis (21 min).mp420.62MB

8 - 3 - Deterministic Selection - Algorithm [Advanced - Optional] (17 min).mp417.55MB

8 - 4 - Deterministic Selection - Analysis I [Advanced - Optional] (22 min).mp422.82MB

8 - 5 - Deterministic Selection - Analysis II [Advanced - Optional] (13 min).mp412.83MB

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

9 - 1 - Graphs and Minimum Cuts (16 min).mp415.21MB

9 - 2 - Graph Representations (14 min).mp415.69MB

9 - 3 - Random Contraction Algorithm (9 min).mp48.28MB

9 - 4 - Analysis of Contraction Algorithm (30 min).mp429.87MB

9 - 5 - Counting Minimum Cuts (7 min).mp47.41MB