| Coursera - Algorithms part 1 (2013)/video/014_3 - 4 - O(n log n) Algorithm for Closest Pair I [Advanced - Optional] (32 min).mp4 |
36.2 MB |
| Coursera - Algorithms part 1 (2013)/video/060_16 - 3 - Binary Search Tree Basics Part II (30 min).mp4 |
30 MB |
| Coursera - Algorithms part 1 (2013)/video/040_9 - 4 - Analysis of Contraction Algorithm (30 min).mp4 |
29.9 MB |
| Coursera - Algorithms part 1 (2013)/video/048_10 - 7 - Computing Strong Components The Algorithm (29 min).mp4 |
29.5 MB |
| Coursera - Algorithms part 1 (2013)/video/049_10 - 8 - Computing Strong Components The Analysis (26 min).mp4 |
26.8 MB |
| Coursera - Algorithms part 1 (2013)/video/054_11 - 4 - Dijkstras Algorithm Implementation and Running Time (26 min).mp4 |
26.5 MB |
| Coursera - Algorithms part 1 (2013)/video/068_14 - 2 - Universal Hashing Definition and Example [Advanced - Optional] (26 min).mp4 |
26.2 MB |
| Coursera - Algorithms part 1 (2013)/video/029_7 - 1 - Part I [Review - Optional] (25 min).mp4 |
25.4 MB |
| Coursera - Algorithms part 1 (2013)/video/023_5 - 2 - Partitioning Around a Pivot (25 min).mp4 |
24.8 MB |
| Coursera - Algorithms part 1 (2013)/video/013_3 - 3 - Strassens Subcubic Matrix Multiplication Algorithm (22 min).mp4 |
23.6 MB |
| Coursera - Algorithms part 1 (2013)/video/042_10 - 1 - Graph Search - Overview (23 min).mp4 |
23.3 MB |
| Coursera - Algorithms part 1 (2013)/video/034_8 - 4 - Deterministic Selection - Analysis I [Advanced - Optional] (22 min).mp4 |
22.8 MB |
| Coursera - Algorithms part 1 (2013)/video/066_13 - 3 - Hash Tables Implementation Details Part II (22 min).mp4 |
22.5 MB |
| Coursera - Algorithms part 1 (2013)/video/067_14 - 1 - Pathological Data Sets and Universal Hashing Motivation (22 min).mp4 |
22.5 MB |
| Coursera - Algorithms part 1 (2013)/video/047_10 - 6 - Topological Sort (22 min).mp4 |
22.1 MB |
| Coursera - Algorithms part 1 (2013)/video/061_16 - 4 - Red-Black Trees (21 min).mp4 |
21.8 MB |
| Coursera - Algorithms part 1 (2013)/video/025_5 - 4 - Choosing a Good Pivot (22min).mp4 |
21.7 MB |
| Coursera - Algorithms part 1 (2013)/video/026_6 - 1 - Analysis I A Decomposition Principle [Advanced - Optional] (22 min).mp4 |
21.6 MB |
| Coursera - Algorithms part 1 (2013)/video/031_8 - 1 - Randomized Selection - Algorithm (22 min).mp4 |
21.4 MB |
| Coursera - Algorithms part 1 (2013)/video/051_11 - 1 - Dijkstras Shortest-Path Algorithm (21 min).mp4 |
21 MB |
| Coursera - Algorithms part 1 (2013)/video/057_12 - 3 - Heaps Implementation Details [Advanced - Optional] (21 min).mp4 |
20.9 MB |
| Coursera - Algorithms part 1 (2013)/video/063_16 - 6 - Insertion in a Red-Black Tree [Advanced] (15 min).mp4 |
20.8 MB |
| Coursera - Algorithms part 1 (2013)/video/032_8 - 2 - Randomized Selection - Analysis (21 min).mp4 |
20.6 MB |
| Coursera - Algorithms part 1 (2013)/video/053_11 - 3 - Correctness of Dijkstras Algorithm [Advanced - Optional] (19 min).mp4 |
20.3 MB |
| Coursera - Algorithms part 1 (2013)/video/015_3 - 5 - O(n log n) Algorithm for Closest Pair II [Advanced - Optional] (19 min).mp4 |
20.1 MB |
| Coursera - Algorithms part 1 (2013)/video/065_13 - 2 - Hash Tables Implementation Details Part I (19 min).mp4 |
19.9 MB |
| Coursera - Algorithms part 1 (2013)/video/064_13 - 1 - Hash Tables Operations and Applications (19 min).mp4 |
19.7 MB |
| Coursera - Algorithms part 1 (2013)/video/001_1 - 1 - Introduction Why Study Algorithms (19 min).mp4 |
19.1 MB |
| Coursera - Algorithms part 1 (2013)/video/050_10 - 9 - Structure of the Web [Optional] (19 min).mp4 |
18.6 MB |
| Coursera - Algorithms part 1 (2013)/video/056_12 - 2 - Heaps Operations and Applications (18 min).mp4 |
18.6 MB |
| Coursera - Algorithms part 1 (2013)/video/069_14 - 3 - Universal Hashing Analysis of Chaining [Advanced - Optional] (19 min).mp4 |
18.5 MB |
| Coursera - Algorithms part 1 (2013)/video/006_1 - 6 - Guiding Principles for Analysis of Algorithms (15 min).mp4 |
18 MB |
| Coursera - Algorithms part 1 (2013)/video/033_8 - 3 - Deterministic Selection - Algorithm [Advanced - Optional] (17 min).mp4 |
17.6 MB |
| Coursera - Algorithms part 1 (2013)/video/002_1 - 2 - About the Course (17 min).mp4 |
17.4 MB |
| Coursera - Algorithms part 1 (2013)/video/030_7 - 2 - Part II [Review - Optional] (17 min).mp4 |
17.3 MB |
| Coursera - Algorithms part 1 (2013)/video/012_3 - 2 - O(n log n) Algorithm for Counting Inversions II (17 min).mp4 |
17.2 MB |
| Coursera - Algorithms part 1 (2013)/video/021_4 - 6 - Proof II (16 min).mp4 |
16.6 MB |
| Coursera - Algorithms part 1 (2013)/video/038_9 - 2 - Graph Representations (14 min).mp4 |
15.7 MB |
| Coursera - Algorithms part 1 (2013)/video/070_14 - 4 - Hash Table Performance with Open Addressing [Advanced - Optional] (16 min).mp4 |
15.6 MB |
| Coursera - Algorithms part 1 (2013)/video/071_15 - 1 - Bloom Filters The Basics (16 min).mp4 |
15.4 MB |
| Coursera - Algorithms part 1 (2013)/video/037_9 - 1 - Graphs and Minimum Cuts (16 min).mp4 |
15.2 MB |
| Coursera - Algorithms part 1 (2013)/video/004_1 - 4 - Merge Sort Pseudocode (13 min).mp4 |
15 MB |
| Coursera - Algorithms part 1 (2013)/video/018_4 - 3 - Examples (13 min).mp4 |
14.4 MB |
| Coursera - Algorithms part 1 (2013)/video/043_10 - 2 - Breadth-First Search (BFS) The Basics (14 min).mp4 |
14.3 MB |
| Coursera - Algorithms part 1 (2013)/video/045_10 - 4 - BFS and Undirected Connectivity (13 min).mp4 |
13.7 MB |
| Coursera - Algorithms part 1 (2013)/video/036_8 - 6 - Omega(n log n) Lower Bound for Comparison-Based Sorting [Advanced - Optional] (13 min).mp4 |
13.7 MB |
| Coursera - Algorithms part 1 (2013)/video/072_15 - 2 - Bloom Filters Heuristic Analysis (13 min).mp4 |
13.6 MB |
| Coursera - Algorithms part 1 (2013)/video/059_16 - 2 - Binary Search Tree Basics Part I (13 min).mp4 |
13.3 MB |
| Coursera - Algorithms part 1 (2013)/video/020_4 - 5 - Interpretation of the 3 Cases (11 min).mp4 |
13.1 MB |
| Coursera - Algorithms part 1 (2013)/video/052_11 - 2 - Dijkstras Algorithm Examples (13 min).mp4 |
12.9 MB |
| Coursera - Algorithms part 1 (2013)/video/011_3 - 1 - O(n log n) Algorithm for Counting Inversions I (13 min).mp4 |
12.9 MB |
| Coursera - Algorithms part 1 (2013)/video/035_8 - 5 - Deterministic Selection - Analysis II [Advanced - Optional] (13 min).mp4 |
12.8 MB |
| Coursera - Algorithms part 1 (2013)/video/022_5 - 1 - Quicksort Overview (12 min).mp4 |
12.2 MB |
| Coursera - Algorithms part 1 (2013)/video/027_6 - 2 - Analysis II The Key Insight [Advanced - Optional] (12min).mp4 |
12 MB |
| Coursera - Algorithms part 1 (2013)/video/024_5 - 3 - Correctness of Quicksort [Review - Optional] (11 min).mp4 |
11.8 MB |
| Coursera - Algorithms part 1 (2013)/video/019_4 - 4 - Proof I (10 min).mp4 |
11.5 MB |
| Coursera - Algorithms part 1 (2013)/video/005_1 - 5 - Merge Sort Analysis (9 min).mp4 |
11.3 MB |
| Coursera - Algorithms part 1 (2013)/video/058_16 - 1 - Balanced Search Trees Operations and Applications (11 min).mp4 |
11 MB |
| Coursera - Algorithms part 1 (2013)/video/003_1 - 3 - Merge Sort Motivation and Example (9 min).mp4 |
10.7 MB |
| Coursera - Algorithms part 1 (2013)/video/017_4 - 2 - Formal Statement (10 min).mp4 |
10.4 MB |
| Coursera - Algorithms part 1 (2013)/video/062_16 - 5 - Rotations [Advanced - Optional] (8 min).mp4 |
10.3 MB |
| Coursera - Algorithms part 1 (2013)/video/028_6 - 3 - Analysis III Final Calculations [Advanced - Optional] (9min).mp4 |
8.9 MB |
| Coursera - Algorithms part 1 (2013)/video/039_9 - 3 - Random Contraction Algorithm (9 min).mp4 |
8.3 MB |
| Coursera - Algorithms part 1 (2013)/video/016_4 - 1 - Motivation (8 min).mp4 |
8.3 MB |
| Coursera - Algorithms part 1 (2013)/video/044_10 - 3 - BFS and Shortest Paths (8 min).mp4 |
7.9 MB |
| Coursera - Algorithms part 1 (2013)/video/010_2 - 4 - Additional Examples [Review - Optional] (8 min).mp4 |
7.7 MB |
| Coursera - Algorithms part 1 (2013)/video/009_2 - 3 - Big Omega and Theta (7 min).mp4 |
7.5 MB |
| Coursera - Algorithms part 1 (2013)/video/041_9 - 5 - Counting Minimum Cuts (7 min).mp4 |
7.4 MB |
| Coursera - Algorithms part 1 (2013)/video/008_2 - 2 - Basic Examples (7 min).mp4 |
7.3 MB |
| Coursera - Algorithms part 1 (2013)/video/046_10 - 5 - Depth-First Search (DFS) The Basics (7 min).mp4 |
7.2 MB |
| Coursera - Algorithms part 1 (2013)/video/055_12 - 1 - Data Structures Overview (5 min).mp4 |
4.7 MB |
| Coursera - Algorithms part 1 (2013)/video/007_2 - 1 - Big-Oh Notation (4 min).mp4 |
4.1 MB |
| Coursera - Algorithms part 1 (2013)/slides/015_algo-closest2_typed.pdf |
3.9 MB |
| Coursera - Algorithms part 1 (2013)/slides/023_algo-qsort-partition_typed.pdf |
3.9 MB |
| Coursera - Algorithms part 1 (2013)/slides/043_algo-graphs-bfs_typed.pdf |
2.7 MB |
| Coursera - Algorithms part 1 (2013)/slides/034_algo-select-danalysis_typed.pdf |
2.2 MB |
| Coursera - Algorithms part 1 (2013)/slides/044_algo-graphs-dfs_typed.pdf |
2.1 MB |
| Coursera - Algorithms part 1 (2013)/slides/014_algo-closest1_typed.pdf |
2.1 MB |
| Coursera - Algorithms part 1 (2013)/slides/032_algo-select-ranalysis_typed.pdf |
2 MB |
| Coursera - Algorithms part 1 (2013)/slides/042_algo-graphs-search_typed.pdf |
2 MB |
| Coursera - Algorithms part 1 (2013)/slides/031_algo-select-ralgorithm_typed.pdf |
1.9 MB |
| Coursera - Algorithms part 1 (2013)/slides/013_algo-strassen_typed.pdf |
1.8 MB |
| Coursera - Algorithms part 1 (2013)/slides/033_algo-select-dalgorithm_typed.pdf |
1.7 MB |
| Coursera - Algorithms part 1 (2013)/slides/058_algo-ds-hash-guts_typed.pdf |
1.6 MB |
| Coursera - Algorithms part 1 (2013)/slides/029_algo-prob_review1_typed.pdf |
1.5 MB |
| Coursera - Algorithms part 1 (2013)/slides/045_algo-graphs-scc_typed.pdf |
1.5 MB |
| Coursera - Algorithms part 1 (2013)/slides/025_algo-qsort-pivot_typed.pdf |
1.5 MB |
| Coursera - Algorithms part 1 (2013)/slides/026_algo-qsort-analysis1_typed.pdf |
1.4 MB |
| Coursera - Algorithms part 1 (2013)/slides/022_algo-qsort-intro_typed.pdf |
1.3 MB |
| Coursera - Algorithms part 1 (2013)/slides/030_algo-prob_review2_typed.pdf |
1.2 MB |
| Coursera - Algorithms part 1 (2013)/slides/024_algo-qsort-correctness_typed.pdf |
1 MB |
| Coursera - Algorithms part 1 (2013)/slides/053_algo-ds-heaps-guts_typed.pdf |
1 MB |
| Coursera - Algorithms part 1 (2013)/slides/028_algo-qsort-analysis3_typed.pdf |
999 KB |
| Coursera - Algorithms part 1 (2013)/slides/009_algo-asymptotic3_typed.pdf |
990 KB |
| Coursera - Algorithms part 1 (2013)/slides/019_algo-master4_typed.pdf |
944 KB |
| Coursera - Algorithms part 1 (2013)/slides/011_algo-inversions1_typed.pdf |
915 KB |
| Coursera - Algorithms part 1 (2013)/slides/018_algo-master3_typed.pdf |
855 KB |
| Coursera - Algorithms part 1 (2013)/slides/021_algo-master6_typed.pdf |
826 KB |
| Coursera - Algorithms part 1 (2013)/slides/010_algo-asymptotic4_typed.pdf |
822 KB |
| Coursera - Algorithms part 1 (2013)/slides/007_algo-asymptotic1_typed.pdf |
812 KB |
| Coursera - Algorithms part 1 (2013)/slides/060_algo-ds-hash-universal-2_typed.pdf |
772 KB |
| Coursera - Algorithms part 1 (2013)/slides/002_algo-about_typed.pdf |
731 KB |
| Coursera - Algorithms part 1 (2013)/slides/001_algo-intro_typed.pdf |
729 KB |
| Coursera - Algorithms part 1 (2013)/slides/005_algo-merge3_typed.pdf |
721 KB |
| Coursera - Algorithms part 1 (2013)/slides/003_algo-merge1_typed.pdf |
697 KB |
| Coursera - Algorithms part 1 (2013)/slides/004_algo-merge2_typed.pdf |
664 KB |
| Coursera - Algorithms part 1 (2013)/slides/039_algo-karger-algorithm_typed.pdf |
627 KB |
| Coursera - Algorithms part 1 (2013)/slides/040_algo-karger-analysis_typed.pdf |
613 KB |
| Coursera - Algorithms part 1 (2013)/slides/006_algo-guiding_typed.pdf |
554 KB |
| Coursera - Algorithms part 1 (2013)/slides/037_algo-karger-overview_typed.pdf |
497 KB |
| Coursera - Algorithms part 1 (2013)/slides/046_algo-graphs-sccanalysis_typed.pdf |
462 KB |
| Coursera - Algorithms part 1 (2013)/slides/038_algo-karger-representations_typed.pdf |
461 KB |
| Coursera - Algorithms part 1 (2013)/slides/055_algo-ds-trees-basics-typed.pdf |
458 KB |
| Coursera - Algorithms part 1 (2013)/slides/016_algo-master1_typed.pdf |
457 KB |
| Coursera - Algorithms part 1 (2013)/slides/012_algo-inversions2_typed.pdf |
452 KB |
| Coursera - Algorithms part 1 (2013)/slides/050_algo-dijkstra-runtime_typed.pdf |
443 KB |
| Coursera - Algorithms part 1 (2013)/slides/049_algo-dijkstra-correctness_typed.pdf |
434 KB |
| Coursera - Algorithms part 1 (2013)/slides/048_algo-dijkstra-basics_typed.pdf |
433 KB |
| Coursera - Algorithms part 1 (2013)/slides/061_algo-ds-hash-universal3-typed.pdf |
370 KB |
| Coursera - Algorithms part 1 (2013)/slides/017_algo-master2_typed.pdf |
362 KB |
| Coursera - Algorithms part 1 (2013)/slides/008_algo-asymptotic2_typed.pdf |
338 KB |
| Coursera - Algorithms part 1 (2013)/slides/035_algo-select-danalysis2_typed.pdf |
305 KB |
| Coursera - Algorithms part 1 (2013)/slides/027_algo-qsort-analysis2_typed.pdf |
301 KB |
| Coursera - Algorithms part 1 (2013)/slides/041_algo-karger-counting_typed.pdf |
280 KB |
| Coursera - Algorithms part 1 (2013)/slides/020_algo-master5_typed.pdf |
277 KB |
| Coursera - Algorithms part 1 (2013)/slides/036_algo-select-sortinglb_typed.pdf |
270 KB |
| Coursera - Algorithms part 1 (2013)/slides/056_algo-ds-trees-redblack-typed.pdf |
247 KB |
| Coursera - Algorithms part 1 (2013)/slides/047_algo-graphs-web_typed.pdf |
245 KB |
| Coursera - Algorithms part 1 (2013)/slides/057_algo-ds-hash-basics_typed.pdf |
224 KB |
| Coursera - Algorithms part 1 (2013)/slides/052_algo-ds-heaps-basics_typed.pdf |
221 KB |
| Coursera - Algorithms part 1 (2013)/slides/051_algo-ds-overview_typed.pdf |
193 KB |
| Coursera - Algorithms part 1 (2013)/slides/063_algo-ds-bloom-typed.pdf |
186 KB |
| Coursera - Algorithms part 1 (2013)/slides/062_algo-ds-hash-universal4-typed.pdf |
152 KB |
| Coursera - Algorithms part 1 (2013)/slides/054_algo-ds-trees-ops-typed.pdf |
123 KB |
| Coursera - Algorithms part 1 (2013)/slides/059_algo-ds-hash-universal1-typed.pdf |
122 KB |
| Coursera - Algorithms part 1 (2013)/subtitles/014_3 - 4 - O(n log n) Algorithm for Closest Pair I [Advanced - Optional] (32 min).srt |
52 KB |
| Coursera - Algorithms part 1 (2013)/subtitles/060_16 - 3 - Binary Search Tree Basics, Part II (30 min).srt |
48 KB |
| Coursera - Algorithms part 1 (2013)/subtitles/048_10 - 7 - Computing Strong Components_ The Algorithm (29 min).srt |
46 KB |
| Coursera - Algorithms part 1 (2013)/subtitles/040_9 - 4 - Analysis of Contraction Algorithm (30 min).srt |
43 KB |
| Coursera - Algorithms part 1 (2013)/subtitles/029_7 - 1 - Part I [Review - Optional] (25 min).srt |
41 KB |
| Coursera - Algorithms part 1 (2013)/subtitles/054_11 - 4 - Dijkstra's Algorithm_ Implementation and Running Time (26 min).srt |
41 KB |
| Coursera - Algorithms part 1 (2013)/subtitles/049_10 - 8 - Computing Strong Components_ The Analysis (26 min).srt |
40 KB |
| Coursera - Algorithms part 1 (2013)/subtitles/042_10 - 1 - Graph Search - Overview (23 min).srt |
38 KB |
| Coursera - Algorithms part 1 (2013)/subtitles/023_5 - 2 - Partitioning Around a Pivot (25 min).srt |
37 KB |
| Coursera - Algorithms part 1 (2013)/subtitles/031_8 - 1 - Randomized Selection - Algorithm (22 min).srt |
36 KB |
| Coursera - Algorithms part 1 (2013)/subtitles/061_16 - 4 - Red-Black Trees (21 min).srt |
35 KB |
| Coursera - Algorithms part 1 (2013)/subtitles/025_5 - 4 - Choosing a Good Pivot (22min).srt |
35 KB |
| Coursera - Algorithms part 1 (2013)/subtitles/026_6 - 1 - Analysis I_ A Decomposition Principle [Advanced - Optional] (22 min).srt |
33 KB |
| Coursera - Algorithms part 1 (2013)/subtitles/047_10 - 6 - Topological Sort (22 min).srt |
33 KB |
| Coursera - Algorithms part 1 (2013)/subtitles/057_12 - 3 - Heaps_ Implementation Details [Advanced - Optional] (21 min).srt |
33 KB |
| Coursera - Algorithms part 1 (2013)/subtitles/034_8 - 4 - Deterministic Selection - Analysis I [Advanced - Optional] (22 min).srt |
33 KB |
| Coursera - Algorithms part 1 (2013)/subtitles/051_11 - 1 - Dijkstra's Shortest-Path Algorithm (21 min).srt |
32 KB |
| Coursera - Algorithms part 1 (2013)/subtitles/013_3 - 3 - Strassen's Subcubic Matrix Multiplication Algorithm (22 min).srt |
31 KB |
| Coursera - Algorithms part 1 (2013)/subtitles/032_8 - 2 - Randomized Selection - Analysis (21 min).srt |
31 KB |
| Coursera - Algorithms part 1 (2013)/subtitles/002_1 - 2 - About the Course (17 min).srt |
30 KB |
| Coursera - Algorithms part 1 (2013)/subtitles/050_10 - 9 - Structure of the Web [Optional] (19 min).srt |
29 KB |
| Coursera - Algorithms part 1 (2013)/subtitles/015_3 - 5 - O(n log n) Algorithm for Closest Pair II [Advanced - Optional] (19 min).srt |
29 KB |
| Coursera - Algorithms part 1 (2013)/subtitles/056_12 - 2 - Heaps_ Operations and Applications (18 min).srt |
29 KB |
| Coursera - Algorithms part 1 (2013)/subtitles/033_8 - 3 - Deterministic Selection - Algorithm [Advanced - Optional] (17 min).srt |
28 KB |
| Coursera - Algorithms part 1 (2013)/subtitles/001_1 - 1 - Introduction _ Why Study Algorithms.srt |
28 KB |
| Coursera - Algorithms part 1 (2013)/subtitles/053_11 - 3 - Correctness of Dijkstra's Algorithm [Advanced - Optional] (19 min).srt |
27 KB |
| Coursera - Algorithms part 1 (2013)/subtitles/012_3 - 2 - O(n log n) Algorithm for Counting Inversions II (17 min).srt |
27 KB |
| Coursera - Algorithms part 1 (2013)/subtitles/006_1 - 6 - Guiding Principles for Analysis of Algorithms (15 min).srt |
24 KB |
| Coursera - Algorithms part 1 (2013)/subtitles/021_4 - 6 - Proof II (16 min).srt |
24 KB |
| Coursera - Algorithms part 1 (2013)/subtitles/030_7 - 2 - Part II [Review - Optional] (17 min).srt |
24 KB |
| Coursera - Algorithms part 1 (2013)/subtitles/037_9 - 1 - Graphs and Minimum Cuts (16 min).srt |
24 KB |
| Coursera - Algorithms part 1 (2013)/subtitles/036_8 - 6 - Omega(n log n) Lower Bound for Comparison-Based Sorting [Advanced - Optional] (13 min).srt |
22 KB |
| Coursera - Algorithms part 1 (2013)/subtitles/043_10 - 2 - Breadth-First Search (BFS)_ The Basics (14 min).srt |
22 KB |
| Coursera - Algorithms part 1 (2013)/subtitles/045_10 - 4 - BFS and Undirected Connectivity (13 min).srt |
22 KB |
| Coursera - Algorithms part 1 (2013)/subtitles/038_9 - 2 - Graph Representations (14 min).srt |
22 KB |
| Coursera - Algorithms part 1 (2013)/subtitles/059_16 - 2 - Binary Search Tree Basics, Part I (13 min).srt |
21 KB |
| Coursera - Algorithms part 1 (2013)/subtitles/035_8 - 5 - Deterministic Selection - Analysis II [Advanced - Optional] (13 min).srt |
20 KB |
| Coursera - Algorithms part 1 (2013)/subtitles/004_1 - 4 - Merge Sort_ Pseudocode (13 min).srt |
20 KB |
| Coursera - Algorithms part 1 (2013)/subtitles/011_3 - 1 - O(n log n) Algorithm for Counting Inversions I (13 min).srt |
20 KB |
| Coursera - Algorithms part 1 (2013)/subtitles/072_15 - 2 - Bloom Filters_ Heuristic Analysis (13 min).srt |
20 KB |
| Coursera - Algorithms part 1 (2013)/subtitles/063_16 - 6 - Insertion in a Red-Black Tree [Advanced] (15 min).srt |
20 KB |
| Coursera - Algorithms part 1 (2013)/subtitles/018_4 - 3 - Examples (13 min).srt |
19 KB |
| Coursera - Algorithms part 1 (2013)/subtitles/052_11 - 2 - Dijkstra's Algorithm_ Examples (13 min).srt |
19 KB |
| Coursera - Algorithms part 1 (2013)/subtitles/022_5 - 1 - Quicksort_ Overview (12 min).srt |
18 KB |
| Coursera - Algorithms part 1 (2013)/subtitles/027_6 - 2 - Analysis II_ The Key Insight [Advanced - Optional] (12min).srt |
17 KB |
| Coursera - Algorithms part 1 (2013)/subtitles/020_4 - 5 - Interpretation of the 3 Cases (11 min).srt |
17 KB |
| Coursera - Algorithms part 1 (2013)/subtitles/058_16 - 1 - Balanced Search Trees_ Operations and Applications (11 min).srt |
17 KB |
| Coursera - Algorithms part 1 (2013)/subtitles/019_4 - 4 - Proof I (10 min).srt |
15 KB |
| Coursera - Algorithms part 1 (2013)/subtitles/017_4 - 2 - Formal Statement (10 min).srt |
14 KB |
| Coursera - Algorithms part 1 (2013)/subtitles/024_5 - 3 - Correctness of Quicksort [Review - Optional] (11 min).srt |
14 KB |
| Coursera - Algorithms part 1 (2013)/subtitles/005_1 - 5 - Merge Sort_ Analysis (9 min).srt |
14 KB |
| Coursera - Algorithms part 1 (2013)/subtitles/039_9 - 3 - Random Contraction Algorithm (9 min).srt |
14 KB |
| Coursera - Algorithms part 1 (2013)/subtitles/003_1 - 3 - Merge Sort_ Motivation and Example (9 min).srt |
13 KB |
| Coursera - Algorithms part 1 (2013)/subtitles/016_4 - 1 - Motivation (8 min).srt |
12 KB |
| Coursera - Algorithms part 1 (2013)/subtitles/046_10 - 5 - Depth-First Search (DFS)_ The Basics (7 min).srt |
12 KB |
| Coursera - Algorithms part 1 (2013)/subtitles/028_6 - 3 - Analysis III_ Final Calculations [Advanced - Optional] (9min).srt |
12 KB |
| Coursera - Algorithms part 1 (2013)/subtitles/010_2 - 4 - Additional Examples [Review - Optional] (8 min).srt |
12 KB |
| Coursera - Algorithms part 1 (2013)/subtitles/044_10 - 3 - BFS and Shortest Paths (8 min).srt |
12 KB |
| Coursera - Algorithms part 1 (2013)/subtitles/009_2 - 3 - Big Omega and Theta (7 min).srt |
12 KB |
| Coursera - Algorithms part 1 (2013)/subtitles/008_2 - 2 - Basic Examples (7 min).srt |
11 KB |
| Coursera - Algorithms part 1 (2013)/subtitles/062_16 - 5 - Rotations [Advanced - Optional] (8 min).srt |
10 KB |
| Coursera - Algorithms part 1 (2013)/subtitles/041_9 - 5 - Counting Minimum Cuts (7 min).srt |
10 KB |
| Coursera - Algorithms part 1 (2013)/subtitles/055_12 - 1 - Data Structures_ Overview (5 min).srt |
7 KB |
| Coursera - Algorithms part 1 (2013)/subtitles/007_2 - 1 - Big-Oh Notation (4 min).srt |
6 KB |
Magnet link
