字幕评分：
举报机器翻译
字幕格式：
不明
查阅次数：
2566次
下载次数：
739次
发布时间：
2015-01-18 09:51:33
字幕来源：
捡来的
匹配视频：
[计算机][算法设计与分析-第一部分-斯坦福大学]Algorithms.Design.and.Analysis-Part1-Stanford-Coursera
文件名：algorithms-design-and-analysis-eng-srt.rar
1 - 1 - Why Study Algorithms - (4 min).srt5.7KB
1 - 2 - Integer Multiplication (9 min).srt11KB
1 - 3 - Karatsuba Multiplication (13 min).srt17.1KB
1 - 4 - About the Course (17 min).srt30.1KB
1 - 5 - Merge Sort- Motivation and Example (9 min).srt13.2KB
1 - 6 - Merge Sort- Pseudocode (13 min).srt20.2KB
1 - 7 - Merge Sort- Analysis (9 min).srt13.8KB
1 - 8 - Guiding Principles for Analysis of Algorithms (15 min).srt24.5KB
10 - 1 - Graph Search - Overview (23 min).srt38.1KB
10 - 2 - Breadth-First Search (BFS)_ The Basics (14 min).srt22.2KB
10 - 3 - BFS and Shortest Paths (8 min).srt11.8KB
10 - 4 - BFS and Undirected Connectivity (13 min).srt22.1KB
10 - 5 - Depth-First Search (DFS)_ The Basics (7 min).srt12.3KB
10 - 6 - Topological Sort (22 min).srt33.1KB
10 - 7 - Computing Strong Components_ The Algorithm (29 min).srt46.2KB
10 - 8 - Computing Strong Components_ The Analysis (26 min).srt39.5KB
10 - 9 - Structure of the Web [Optional] (19 min).srt29.4KB
11 - 1 - Dijkstra_'s Shortest-Path Algorithm (21 min).srt32.2KB
11 - 2 - Dijkstra_'s Algorithm_ Examples (13 min).srt18.8KB
11 - 3 - Correctness of Dijkstra_'s Algorithm [Advanced - Optional] (19 min).srt27.3KB
11 - 4 - Dijkstra_'s Algorithm_ Implementation and Running Time (26 min).srt40.5KB
12 - 1 - Data Structures_ Overview (5 min).srt7.2KB
12 - 2 - Heaps_ Operations and Applications (18 min).srt28.6KB
12 - 3 - Heaps_ Implementation Details [Advanced - Optional] (21 min).srt32.7KB
13 - 1 - Balanced Search Trees_ Operations and Applications (11 min).srt16.9KB
13 - 2 - Binary Search Tree Basics, Part I (13 min).srt20.9KB
13 - 3 - Binary Search Tree Basics, Part II (30 min).srt47.5KB
13 - 4 - Red-Black Trees (21 min).srt35.3KB
13 - 5 - Rotations [Advanced - Optional] (8 min).srt10.4KB
13 - 6 - Insertion in a Red-Black Tree [Advanced] (15 min).srt21.3KB
14 - 1 - Hash Tables_ Operations and Applications (19 min).srt32.2KB
14 - 2 - Hash Tables_ Implementation Details, Part I (19 min).srt31.6KB
14 - 3 - Hash Tables_ Implementation Details, Part II (22 min).srt36.7KB
15 - 1 - Pathological Data Sets and Universal Hashing Motivation (22 min).srt35.2KB
15 - 2 - Universal Hashing_ Definition and Example [Advanced - Optional] (26 min).srt39.4KB
15 - 3 - Universal Hashing_ Analysis of Chaining [Advanced - Optional] (19 min).srt28.4KB
15 - 4 - Hash Table Performance with Open Addressing [Advanced - Optional] (16 min).srt25KB
16 - 1 - Bloom Filters_ The Basics (16 min).srt26.4KB
16 - 2 - Bloom Filters_ Heuristic Analysis (13 min).srt20KB
17 - 1 - Application- Internet Routing [Optional] (11 min).srt17.8KB
17 - 2 - Application- Sequence Alignment [Optional] (9 min).srt13KB
17 - 3 - Introduction to Greedy Algorithms [Optional] (13 min).srt21.8KB
17 - 4 - Huffman Codes- Introduction and Motivation [Optional] (9 min).srt14.2KB
17 - 5 - Principles of Dynamic Programming [Optional] (8 min).srt12.3KB
17 - 6 - The P vs. NP Question [Optional] (9 min).srt13.3KB
17 - 7 - Algorithmic Approaches to NP-Complete Problems [Optional] (13 min).srt20.5KB
2 - 1 - The Gist (14 min).srt21.2KB
2 - 2 - Big-Oh Notation (4 min).srt6.3KB
2 - 3 - Basic Examples (7 min).srt11.1KB
2 - 4 - Big Omega and Theta (7 min).srt11.7KB
2 - 5 - Additional Examples [Review - Optional] (8 min).srt12KB
3 - 1 - O(n log n) Algorithm for Counting Inversions I (13 min).srt20.1KB
3 - 2 - O(n log n) Algorithm for Counting Inversions II (17 min).srt27.3KB
3 - 3 - Strassen-'s Subcubic Matrix Multiplication Algorithm (22 min).srt31.4KB
3 - 4 - O(n log n) Algorithm for Closest Pair I [Advanced - Optional] (32 min).srt52KB
3 - 5 - O(n log n) Algorithm for Closest Pair II [Advanced - Optional] (19 min).srt29.1KB
4 - 1 - Motivation (8 min).srt12.3KB
4 - 2 - Formal Statement (10 min).srt14.4KB
4 - 3 - Examples (13 min).srt19.2KB
4 - 4 - Proof I (10 min).srt15.3KB
4 - 5 - Interpretation of the 3 Cases (11 min).srt17.2KB
4 - 6 - Proof II (16 min).srt24.4KB
5 - 1 - Quicksort- Overview (12 min).srt17.7KB
5 - 2 - Partitioning Around a Pivot (25 min).srt36.8KB
5 - 3 - Correctness of Quicksort [Review - Optional] (11 min).srt14KB
5 - 4 - Choosing a Good Pivot (22min).srt34.9KB
6 - 1 - Analysis I- A Decomposition Principle [Advanced - Optional] (22 min).srt33.3KB
6 - 2 - Analysis II- The Key Insight [Advanced - Optional] (12min).srt17.3KB
6 - 3 - Analysis III- Final Calculations [Advanced - Optional] (9min).srt12.1KB
7 - 1 - Part I [Review - Optional] (25 min).srt40.9KB
7 - 2 - Part II [Review - Optional] (17 min).srt24.4KB
8 - 1 - Randomized Selection - Algorithm (22 min).srt35.5KB
8 - 2 - Randomized Selection - Analysis (21 min).srt31.2KB
8 - 3 - Deterministic Selection - Algorithm [Advanced - Optional] (17 min).srt27.8KB
8 - 4 - Deterministic Selection - Analysis I [Advanced - Optional] (22 min).srt32.7KB
8 - 5 - Deterministic Selection - Analysis II [Advanced - Optional] (13 min).srt20.4KB
8 - 6 - Omega(n log n) Lower Bound for Comparison-Based Sorting [Advanced - Optional] (13 min).srt22.3KB
9 - 1 - Graphs and Minimum Cuts (16 min).srt23.9KB
9 - 2 - Graph Representations (14 min).srt21.7KB
9 - 3 - Random Contraction Algorithm (9 min).srt13.6KB
9 - 4 - Analysis of Contraction Algorithm (30 min).srt42.6KB
9 - 5 - Counting Minimum Cuts (7 min).srt9.6KB
提示：单击列表可直接下载单个文件，如果失败请下载压缩包
