 |  | 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.90 MB) |
| | 10 - 4 - BFS and Undirected Connectivity (13 min).mp4 (13.70 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.50 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.60 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.10 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.30 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.40 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.60 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.40 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) |
|  | algo-about_typed.pdf (731.44 KB) |
| | algo-asymptotic1_typed.pdf (812.01 KB) |
| | algo-asymptotic2_typed.pdf (337.64 KB) |
| | algo-asymptotic3_typed.pdf (989.55 KB) |
| | algo-asymptotic4_typed.pdf (822.38 KB) |
| | algo-closest1_typed.pdf (2.08 MB) |
| | algo-closest2_typed.pdf (3.88 MB) |
| | algo-dijkstra-basics_typed.pdf (432.73 KB) |
| | algo-dijkstra-correctness_typed.pdf (433.84 KB) |
| | algo-dijkstra-runtime_typed.pdf (442.96 KB) |
| | algo-ds-bloom-typed.pdf (185.88 KB) |
| | algo-ds-hash-basics_typed.pdf (223.62 KB) |
| | algo-ds-hash-guts_typed.pdf (1.65 MB) |
| | algo-ds-hash-universal-2_typed.pdf (771.91 KB) |
| | algo-ds-hash-universal1-typed.pdf (122.20 KB) |
| | algo-ds-hash-universal3-typed.pdf (369.74 KB) |
| | algo-ds-hash-universal4-typed.pdf (152.46 KB) |
| | algo-ds-heaps-basics_typed.pdf (220.89 KB) |
| | algo-ds-heaps-guts_typed.pdf (1.02 MB) |
| | algo-ds-overview_typed.pdf (192.87 KB) |
| | algo-ds-trees-basics-typed.pdf (457.52 KB) |
| | algo-ds-trees-ops-typed.pdf (122.54 KB) |
| | algo-ds-trees-redblack-typed.pdf (246.64 KB) |
| | algo-graphs-bfs_typed.pdf (2.70 MB) |
| | algo-graphs-dfs_typed.pdf (2.09 MB) |
| | algo-graphs-scc_typed.pdf (1.51 MB) |
| | algo-graphs-sccanalysis_typed.pdf (462.39 KB) |
| | algo-graphs-search_typed.pdf (1.99 MB) |
| | algo-graphs-web_typed.pdf (245.49 KB) |
| | algo-guiding_typed.pdf (554.01 KB) |
| | algo-inversions1_typed.pdf (915.10 KB) |
| | algo-inversions2_typed.pdf (452.36 KB) |
| | algo-karger-algorithm_typed.pdf (626.84 KB) |
| | algo-karger-analysis_typed.pdf (613.31 KB) |
| | algo-karger-counting_typed.pdf (279.53 KB) |
| | algo-karger-overview_typed.pdf (496.72 KB) |
| | algo-karger-representations_typed.pdf (461.31 KB) |
| | algo-master1_typed.pdf (456.60 KB) |
| | algo-master2_typed.pdf (362.17 KB) |
| | algo-master3_typed.pdf (855.17 KB) |
| | algo-master4_typed.pdf (944.36 KB) |
| | algo-master5_typed.pdf (276.98 KB) |
| | algo-master6_typed.pdf (825.66 KB) |
| | algo-merge1_typed.pdf (697.13 KB) |
| | algo-merge2_typed.pdf (663.91 KB) |
| | algo-merge3_typed.pdf (720.55 KB) |
| | algo-prob_review1_typed.pdf (1.54 MB) |
| | algo-prob_review2_typed.pdf (1.21 MB) |
| | algo-qsort-analysis1_typed.pdf (1.40 MB) |
| | algo-qsort-analysis2_typed.pdf (301.39 KB) |
| | algo-qsort-analysis3_typed.pdf (999.48 KB) |
| | algo-qsort-correctness_typed.pdf (1.03 MB) |
| | algo-qsort-intro_typed.pdf (1.30 MB) |
| | algo-qsort-partition_typed.pdf (3.87 MB) |
| | algo-qsort-pivot_typed.pdf (1.46 MB) |
| | algo-select-dalgorithm_typed.pdf (1.70 MB) |
| | algo-select-danalysis2_typed.pdf (305.30 KB) |
| | algo-select-danalysis_typed.pdf (2.22 MB) |
| | algo-select-ralgorithm_typed.pdf (1.94 MB) |
| | algo-select-ranalysis_typed.pdf (2.05 MB) |
| | algo-select-sortinglb_typed.pdf (269.98 KB) |
| | algo-strassen_typed.pdf (1.83 MB) |
| | algo1-aa-gist_typed.pdf (273.40 KB) |
| | algo1-intro2_typed.pdf (610.98 KB) |
| | algo1-intro3_typed.pdf (677.17 KB) |
| | redblack1_typed.pdf (100.77 KB) |
 | | redblack2_typed.pdf (109.02 KB) |
