zhongziso种子搜
首页
功能
磁力转BT
BT转磁力
使用教程
免责声明
关于
zhongziso
搜索
Coursera- Algorithm Design & Analysis 1
magnet:?xt=urn:btih:D7BDB6A29702CB5B6E2B082BA08410247A3689B0&dn=Coursera- Algorithm Design & Analysis 1
磁力链接详情
Hash值:
D7BDB6A29702CB5B6E2B082BA08410247A3689B0
点击数:
129
文件大小:
1.4 GB
文件数量:
82
创建日期:
2015-12-14 17:32
最后访问:
2024-6-26 08:39
访问标签:
Coursera-
Algorithm
Design
&
Analysis
1
文件列表详情
1 - 1 - Why Study Algorithms _ (4 min).mp4 7.98 MB
1 - 2 - Integer Multiplication (9 min).mp4 16.86 MB
1 - 3 - Karatsuba Multiplication (13 min).mp4 21.66 MB
1 - 4 - About the Course (17 min).mp4 17.37 MB
1 - 5 - Merge Sort_ Motivation and Example (9 min).mp4 10.68 MB
1 - 6 - Merge Sort_ Pseudocode (13 min).mp4 15.01 MB
1 - 7 - Merge Sort_ Analysis (9 min).mp4 11.31 MB
1 - 8 - Guiding Principles for Analysis of Algorithms (15 min).mp4 17.99 MB
10 - 1 - Graph Search - Overview (23 min).mp4 23.25 MB
10 - 2 - Breadth-First Search (BFS)_ The Basics (14 min).mp4 14.28 MB
10 - 3 - BFS and Shortest Paths (8 min).mp4 7.9 MB
10 - 4 - BFS and Undirected Connectivity (13 min).mp4 13.7 MB
10 - 5 - Depth-First Search (DFS)_ The Basics (7 min).mp4 7.16 MB
10 - 6 - Topological Sort (22 min).mp4 22.08 MB
10 - 7 - Computing Strong Components_ The Algorithm (29 min).mp4 29.5 MB
10 - 8 - Computing Strong Components_ The Analysis (26 min).mp4 26.77 MB
10 - 9 - Structure of the Web [Optional] (19 min).mp4 18.63 MB
11 - 1 - Dijkstra_'s Shortest-Path Algorithm (21 min).mp4 20.96 MB
11 - 2 - Dijkstra_'s Algorithm_ Examples (13 min).mp4 12.88 MB
11 - 3 - Correctness of Dijkstra_'s Algorithm [Advanced - Optional] (19 min).mp4 20.31 MB
11 - 4 - Dijkstra_'s Algorithm_ Implementation and Running Time (26 min).mp4 26.46 MB
12 - 1 - Data Structures_ Overview (5 min).mp4 4.66 MB
12 - 2 - Heaps_ Operations and Applications (18 min).mp4 18.62 MB
12 - 3 - Heaps_ Implementation Details [Advanced - Optional] (21 min).mp4 20.92 MB
13 - 1 - Balanced Search Trees_ Operations and Applications (11 min).mp4 10.99 MB
13 - 2 - Binary Search Tree Basics, Part I (13 min).mp4 13.28 MB
13 - 3 - Binary Search Tree Basics, Part II (30 min).mp4 29.97 MB
13 - 4 - Red-Black Trees (21 min).mp4 21.83 MB
13 - 5 - Rotations [Advanced - Optional] (8 min).mp4 10.32 MB
13 - 6 - Insertion in a Red-Black Tree [Advanced] (15 min).mp4 20.78 MB
14 - 1 - Hash Tables_ Operations and Applications (19 min).mp4 19.73 MB
14 - 2 - Hash Tables_ Implementation Details, Part I (19 min).mp4 19.88 MB
14 - 3 - Hash Tables_ Implementation Details, Part II (22 min).mp4 22.53 MB
15 - 1 - Pathological Data Sets and Universal Hashing Motivation (22 min).mp4 22.49 MB
15 - 2 - Universal Hashing_ Definition and Example [Advanced - Optional] (26 min).mp4 26.15 MB
15 - 3 - Universal Hashing_ Analysis of Chaining [Advanced - Optional] (19 min).mp4 18.46 MB
15 - 4 - Hash Table Performance with Open Addressing [Advanced - Optional] (16 min).mp4 15.6 MB
16 - 1 - Bloom Filters_ The Basics (16 min).mp4 15.43 MB
16 - 2 - Bloom Filters_ Heuristic Analysis (13 min).mp4 13.57 MB
17 - 1 - Application_ Internet Routing [Optional] (11 min).mp4 13.85 MB
17 - 2 - Application_ Sequence Alignment [Optional] (9 min).mp4 11.1 MB
17 - 3 - Introduction to Greedy Algorithms [Optional] (13 min).mp4 18.04 MB
17 - 4 - Huffman Codes_ Introduction and Motivation [Optional] (9 min).mp4 11.89 MB
17 - 5 - Principles of Dynamic Programming [Optional] (8 min).mp4 12.27 MB
17 - 6 - The P vs. NP Question [Optional] (9 min).mp4 14.28 MB
17 - 7 - Algorithmic Approaches to NP-Complete Problems [Optional] (13 min).mp4 19.86 MB
2 - 1 - The Gist (14 min).mp4 27.68 MB
2 - 2 - Big-Oh Notation (4 min).mp4 4.13 MB
2 - 3 - Basic Examples (7 min).mp4 7.3 MB
2 - 4 - Big Omega and Theta (7 min).mp4 7.49 MB
2 - 5 - Additional Examples [Review - Optional] (8 min).mp4 7.72 MB
3 - 1 - O(n log n) Algorithm for Counting Inversions I (13 min).mp4 12.85 MB
3 - 2 - O(n log n) Algorithm for Counting Inversions II (17 min).mp4 17.19 MB
3 - 3 - Strassen_'s Subcubic Matrix Multiplication Algorithm (22 min).mp4 23.57 MB
3 - 4 - O(n log n) Algorithm for Closest Pair I [Advanced - Optional] (32 min).mp4 36.22 MB
3 - 5 - O(n log n) Algorithm for Closest Pair II [Advanced - Optional] (19 min).mp4 20.14 MB
4 - 1 - Motivation (8 min).mp4 8.25 MB
4 - 2 - Formal Statement (10 min).mp4 10.42 MB
4 - 3 - Examples (13 min).mp4 14.4 MB
4 - 4 - Proof I (10 min).mp4 11.46 MB
4 - 5 - Interpretation of the 3 Cases (11 min).mp4 13.11 MB
4 - 6 - Proof II (16 min).mp4 16.6 MB
5 - 1 - Quicksort_ Overview (12 min).mp4 12.19 MB
5 - 2 - Partitioning Around a Pivot (25 min).mp4 24.84 MB
5 - 3 - Correctness of Quicksort [Review - Optional] (11 min).mp4 11.82 MB
5 - 4 - Choosing a Good Pivot (22min).mp4 27.55 MB
6 - 1 - Analysis I_ A Decomposition Principle [Advanced - Optional] (22 min).mp4 21.65 MB
6 - 2 - Analysis II_ The Key Insight [Advanced - Optional] (12min).mp4 11.98 MB
6 - 3 - Analysis III_ Final Calculations [Advanced - Optional] (9min).mp4 8.92 MB
7 - 1 - Part I [Review - Optional] (25 min).mp4 25.42 MB
7 - 2 - Part II [Review - Optional] (17 min).mp4 17.26 MB
8 - 1 - Randomized Selection - Algorithm (22 min).mp4 21.4 MB
8 - 2 - Randomized Selection - Analysis (21 min).mp4 20.62 MB
8 - 3 - Deterministic Selection - Algorithm [Advanced - Optional] (17 min).mp4 17.55 MB
8 - 4 - Deterministic Selection - Analysis I [Advanced - Optional] (22 min).mp4 22.82 MB
8 - 5 - Deterministic Selection - Analysis II [Advanced - Optional] (13 min).mp4 12.83 MB
8 - 6 - Omega(n log n) Lower Bound for Comparison-Based Sorting [Advanced - Optional] (13 min).mp4 13.68 MB
9 - 1 - Graphs and Minimum Cuts (16 min).mp4 15.21 MB
9 - 2 - Graph Representations (14 min).mp4 15.69 MB
9 - 3 - Random Contraction Algorithm (9 min).mp4 8.28 MB
9 - 4 - Analysis of Contraction Algorithm (30 min).mp4 29.87 MB
9 - 5 - Counting Minimum Cuts (7 min).mp4 7.41 MB
其他位置