Algorithms I (2014) by Bob Sedgewick at Princeton

# You can also click the upper-left icon to select videos from the playlist.

source: Algorithms and Data Structures     2014年8月13日

1 Union-Find-1. Course Introduction 9:18
1 Union-Find-2. Dynamic Connectivity 10:19
1 Union-Find-3. Quick Find 10:14
1 Union-Find-4. Quick Union 7:45
1 Union-Find-5. Quick Union Improvements 12:58
1 Union-Find-6. Union Find Applications 9:17
2 Analysis of Algorithms-1. Analysis of Algorithms Introduction 8:11
2 Analysis of Algorithms-2. Observations 10:01
2 Analysis of Algorithms-3. Mathematical Models 12:44
2 Analysis of Algorithms-4. Order of Growth Classifications 14:34
2 Analysis of Algorithms-5. Theory of Algorithms 11:31
2 Analysis of Algorithms-6. Memory 8:07
3 Stacks and Queues-1. Stacks 16:20
3 Stacks and Queues-2. Resizing Arrays 9:52
3 Stacks and Queues-3. Queues 4:30
3 Stacks and Queues-4. Generics 9:22
3 Stacks and Queues-5. Iterators 7:13
3 Stacks and Queues-6. Stack and Queue Applications 13:21
4 Elementary Sorts-1. Sorting Introduction 14:39
4 Elementary Sorts-2. Selection Sort 6:55
4 Elementary Sorts-3. Insertion Sort 9:25
4 Elementary Sorts-4. Shellsort 10:45
4 Elementary Sorts-5. Shuffling 7:36
4 Elementary Sorts-6. Convex Hull 13:47
5 Mergesort-1. Mergesort 23:50
5 Mergesort-2. Bottom up Mergesort 3:17
5 Mergesort-3. Sorting Complexity 9:02
5 Mergesort-4. Comparators 6:40
5 Mergesort-5. Stability 5:36
6 Quicksort-1. Quicksort 19:30
6 Quicksort-2. Selection 7:05
6 Quicksort-3. Duplicate Keys 11:21
6 Quicksort-4. System Sorts 11:46
7 Priority Queues-1. APIs and Elementary Implementations 12:49
7 Priority Queues-2. Binary Heaps 23:32
7 Priority Queues-3. Heapsort 14:26
7 Priority Queues-4. Event Driven Simulation 22:35
8 Elementary Symbol Tables-1. Symbol Table API 21:27
8 Elementary Symbol Tables-2. Elementary Implementations 9:00
8 Elementary Symbol Tables-3. Ordered Operations 6:22
8 Elementary Symbol Tables-4. Binary Search Trees 19:53
8 Elementary Symbol Tables-5. Ordered Operations in BSTs 10:28
8 Elementary Symbol Tables-6. Deletion in BSTs 9:49
9 Balanced Search Trees-1. Search Trees 16:51
9 Balanced Search Trees-2. Red Black BSTs 35:23
9 Balanced Search Trees-3. B Trees 10:33
10 Geometric Applications of BST-1. Range Search 8:48
10 Geometric Applications of BST-2. Line Segment Intersection 5:43
10 Geometric Applications of BST-3. Kd Trees 29:02
10 Geometric Applications of BST-4. Interval Search Trees 13:43
10 Geometric Applications of BST-5. Rectangle Intersection 8:07
11 Hash Tables-1. Hash Functions 18:09
11 Hash Tables-2. Separate Chaining 7:24
11 Hash Tables-3. Linear Probing 14:34
11 Hash Tables-4. Hash Table Context 10:06
11 Hash Tables-5. Symbol Table Applications Sets 4:59
11 Hash Tables-6. Symbol Table Applications Dictionary Clients 5:36
11 Hash Tables-7. Symbol Table Applications Indexing Clients 8:53
11 Hash Tables-8. Symbol Table Applications Sparse Vectors 7:36

Algorithms II (2014) by Bob Sedgewick at Princeton

# You can also click the upper-left icon to select videos from the playlist.

source: Algorithms and Data Structures     2014年8月13日

1 Undirected Graphs-7. Graph Challenges 14:23
1 Undirected Graphs-6. Connected Components 18:51
1 Undirected Graphs-5. Breadth First Search 13:27
1 Undirected Graphs-4. Depth First Search 26:18
1 Undirected Graphs-3. Graph API 14:41
1 Undirected Graphs-2. Introduction to Graphs 9:26
1 Undirected Graphs-1. Course Introduction 9:17
2 Directed Graphs-5. Strong Components 20:16
2 Directed Graphs-4. Topological Sort 12:48
2 Directed Graphs-3. Digraph Search 20:51
2 Directed Graphs-2. Digraph API 4:51
2 Directed Graphs-1. Introduction to Digraphs 8:23
3 Minimum Spanning Trees-6. Minimum Spanning Trees Context 10:29
3 Minimum Spanning Trees-5. Prim's Algorithm 33:09
3 Minimum Spanning Trees-4. Kruskals Algorithm 12:23
3 Minimum Spanning Trees-3. Edge Weighted Graph API 11:10
3 Minimum Spanning Trees-2. Greedy Algorithm 11:55
3 Minimum Spanning Trees-1. Introduction to MSTs 3:59
4 Shortest Paths-5. Negative Weights 20:56
4 Shortest Paths-4. Edge Weighted DAGs 19:18
4 Shortest Paths-3. Dijkstras Algorithm 18:53
4 Shortest Paths-2. Shortest Path Properties 14:41
4 Shortest Paths-1. Shortest Paths APIs 10:46
5 Maximum Flow-6. Maxflow Applications 22:14
5 Maximum Flow-5. Java Implementation 14:24
5 Maximum Flow-4. Running Time Analysis 8:45
5 Maximum Flow-3. Maxflow Mincut Theorem 9:33
5 Maximum Flow-2. Ford Fulkerson Algorithm 6:27
5 Maximum Flow-1. Introduction to Maxflow 10:29
6 Radix Sorts-6. Suffix Arrays 19:19
6 Radix Sorts-5. 3 Way Radix Quicksort 7:17
6 Radix Sorts-4. Most Significant Digit First String Radix Sort 13:37
6 Radix Sorts-3. Least Significant Digit First String Radix Sort 14:55
6 Radix Sorts-2. Key Indexed Counting 12:01
6 Radix Sorts-1. Strings in Java 17:38
7 Tries-3. Character Based Operations 19:58
7 Tries-2. Ternary Search Tries 22:36
7 Tries-1. R Way Tries 32:13
8 Substring Search-5. Rabin-Karp 16:08
8 Substring Search-4. Boyer-Moore 8:31
8 Substring Search-3. Knuth-Morris Pratt 33:09
8 Substring Search-2. Brute-Force Substring Search 10:04
8 Substring Search-1. Introduction to Substring Search 6:37
9 Regular Expressions-5. Regular Expression Applications 20:04
9 Regular Expressions-4. Deterministic Finite Automatons (DFAs) Construction 11:37
9 Regular Expressions-3. Deterministic Finite Automatons (DFAs) Simulation 18:22
9 Regular Expressions-2. Regular Expressions and Deterministic Finite Automatons (DFAs) 13:12
9 Regular Expressions-1. Regular Expressions 20:02
10 Data Compression-4. Lempel-Ziv-Welch (LZW) Compression 27:34
10 Data Compression-3. Huffman Compression 24:07
10 Data Compression-2. Run Length Coding 5:54
10 Data Compression-1. Introduction to Data Compression 22:19
11 Reductions-4. Classifying Problems 12:40
11 Reductions-3. Establishing Lower Bounds 9:18
11 Reductions-2. Designing Algorithms 8:08
11 Reductions-1. Introduction to Reductions 9:27
12 Linear Programming-4. Linear Programming Reductions 11:41
12 Linear Programming-3. Simplex Implementations 16:15
12 Linear Programming-2. Simplex Algorithm 11:44
12 Linear Programming-1. Brewer's Problem 21:10
13 Intractability-6. Coping with Intractability 13:56
13 Intractability-5. NP Completeness 12:33
13 Intractability-4. Classifying Problems 13:38
13 Intractability-3. P vs NP 16:25
13 Intractability-2. Search Problems 10:52
13 Intractability-1. Introduction to Intractability 16:54