9 4 Analysis of Contraction Algorithm 30 min
30:05
9 4 Analysis of Contraction Algorithm 30 min
10 1 Graph Search Overview 23 min
23:20
10 1 Graph Search Overview 23 min
9 5 Counting Minimum Cuts 7 min
7:19
9 5 Counting Minimum Cuts 7 min
9 2 Graph Representations 14 min
14:23
9 2 Graph Representations 14 min
8 6 Omegan log n Lower Bound for Comparison Based Sorting Advanced Optional 13 min
13:30
8 6 Omegan log n Lower Bound for Comparison Based Sorting Advanced Optional 13 min
9 1 Graphs and Minimum Cuts 16 min
15:51
9 1 Graphs and Minimum Cuts 16 min
8 5 Deterministic Selection Analysis II Advanced Optional 13 min
12:42
8 5 Deterministic Selection Analysis II Advanced Optional 13 min
4 6 Proof II 16 min
16:16
4 6 Proof II 16 min
9 3 Random Contraction Algorithm 9 min
8:45
9 3 Random Contraction Algorithm 9 min
4 5 Interpretation of the 3 Cases 11 min
10:47
4 5 Interpretation of the 3 Cases 11 min
8 2 Randomized Selection Analysis 21 min
20:35
8 2 Randomized Selection Analysis 21 min
8 4 Deterministic Selection Analysis I Advanced Optional 22 min
22:02
8 4 Deterministic Selection Analysis I Advanced Optional 22 min
4 4 Proof I 10 min
9:58
4 4 Proof I 10 min
8 1 Randomized Selection Algorithm 22 min
21:40
8 1 Randomized Selection Algorithm 22 min
8 3 Deterministic Selection Algorithm Advanced Optional 17 min
16:57
8 3 Deterministic Selection Algorithm Advanced Optional 17 min
4 3 Examples 13 min
13:06
4 3 Examples 13 min
7 2 Part II Review Optional 17 min
17:21
7 2 Part II Review Optional 17 min
7 1 Part I Review Optional 25 min
25:58
7 1 Part I Review Optional 25 min
4 2 Formal Statement 10 min
9:58
4 2 Formal Statement 10 min
6 3 Analysis III Final Calculations Advanced Optional 9min
8:58
6 3 Analysis III Final Calculations Advanced Optional 9min
4 1 Motivation 8 min
7:48
4 1 Motivation 8 min
3 5 On log n Algorithm for Closest Pair II Advanced Optional 19 min
18:59
3 5 On log n Algorithm for Closest Pair II Advanced Optional 19 min
6 2 Analysis II The Key Insight Advanced Optional 12min
11:48
6 2 Analysis II The Key Insight Advanced Optional 12min
3 4 On log n Algorithm for Closest Pair I Advanced Optional 32 min
31:47
3 4 On log n Algorithm for Closest Pair I Advanced Optional 32 min
6 1 Analysis I A Decomposition Principle Advanced Optional 22 min
21:49
6 1 Analysis I A Decomposition Principle Advanced Optional 22 min
5 4 Choosing a Good Pivot 22min
22:26
5 4 Choosing a Good Pivot 22min
14 2 Hash Tables Implementation Details, Part I 19 min
18:59
14 2 Hash Tables Implementation Details, Part I 19 min
3 3 Strassen 's Subcubic Matrix Multiplication Algorithm 22 min
22:32
3 3 Strassen 's Subcubic Matrix Multiplication Algorithm 22 min
2 2 Big Oh Notation 4 min
4:10
2 2 Big Oh Notation 4 min
10 7 Computing Strong Components The Algorithm 29 min
29:22
10 7 Computing Strong Components The Algorithm 29 min