Lecture Slides
Here are lecture slides that accompany Algorithms, 4th Edition.
Keynote slides available
by request
for instructors who adopt the textbook.
| # | TOPIC | SLIDES | DEMOS |
|---|---|---|---|
| 0 | Introduction | 1up · 4up | – |
| 1.1 | Programming Model | – | |
| 1.2 | Data Abstraction | – | |
| 1.3 | Stacks and Queues | 1up · 4up | Dijkstra 2-stack |
| 1.4 | Analysis of Algorithms | 1up · 4up | Binary search |
| 1.5 | Case Study: Union Find | 1up · 4up | Quick-find · Quick-union |
| 2.1 | Elementary Sorts | 1up · 4up | Selection · Insertion · Knuth shuffle |
| 2.2 | Mergesort | 1up · 4up | Merging |
| 2.3 | Quicksort | 1up · 4up | Partitioning |
| 2.4 | Priority Queues | 1up · 4up | Heap · Heapsort |
| 3.1 | Elementary Symbol Tables | 1up · 4up | – |
| 3.2 | Binary Search Trees | 1up · 4up | BST |
| 3.3 | Balanced Search Trees | 1up · 4up | 2-3 tree · Red-black BST · GrowingTree |
| – | Geometric Applications of BST | 1up · 4up | Kd tree · Interval search tree |
| 3.4 | Hash Tables | 1up · 4up | Separate chaining · Linear probing |
| 3.5 | Searching Applications | 1up · 4up | – |
| 4.1 | Undirected Graphs | 1up · 4up | DFS · BFS · Connected components |
| 4.2 | Directed Graphs | 1up · 4up | DFS · Topological sort · Kosaraju-Sharir |
| 4.3 | Minimum Spanning Trees | 1up · 4up | Greedy · Kruskal · Prim |
| 4.4 | Shortest Paths | 1up · 4up | Dijkstra · Acyclic · Bellman-Ford |
| 5.1 | String Sorts | 1up · 4up | Key-indexed counting · String sorts |
| 5.2 | Tries | 1up · 4up | Trie · TST |
| 5.3 | Substring Search | 1up · 4up | Substring search · KMP |
| 5.4 | Regular Expressions | 1up · 4up | NFA simulation · NFA construction |
| 5.5 | Data Compression | 1up · 4up | Huffman · LZW |
| 6.4 | Maximum flow | 1up · 4up | Ford-Fulkerson |
| – | Linear Programming | 1up · 4up | Simplex |