Lecture Slides


Here are lecture slides that accompany Algorithms, 4th Edition.


# TOPIC SLIDES DEMOS
0 Introduction1up · 4up
1.1 Programming Model 
1.2 Data Abstraction 
1.3 Stacks and Queues1up · 4up Dijkstra 2-stack
1.4 Analysis of Algorithms1up · 4up Binary search
1.5 Case Study: Union Find1up · 4up Quick-find · Quick-union · Weighted
2.1 Elementary Sorts1up · 4up Selection · Insertion · h-sorting · Knuth shuffle
2.2 Mergesort1up · 4up Merging
2.3 Quicksort1up · 4up Partitioning · Quick-select
2.4 Priority Queues1up · 4up Heap · Heapsort
3.1 Elementary Symbol Tables1up · 4up
3.2 Binary Search Trees1up · 4up BST
3.3 Balanced Search Trees1up · 4up 2–3 tree · Red–black BST · GrowingTree
Geometric Applications of BSTs1up · 4up Kd tree · Interval search tree
3.4 Hash Tables1up · 4up Separate chaining · Linear probing
3.5 Searching Applications1up · 4up
4.1 Undirected Graphs1up · 4up DFS · BFS · Connected components
4.2 Directed Graphs1up · 4up DFS · BFS · Topological sort · Kosaraju–Sharir
4.3 Minimum Spanning Trees1up · 4up Greedy · Kruskal · Prim
4.4 Shortest Paths1up · 4up Dijkstra · Acyclic · Bellman–Ford
5.1 String Sorts1up · 4up Key-indexed counting · String sorts
5.2 Tries1up · 4up Trie · TST
5.3 Substring Search1up · 4up KMP · Substring search
5.4 Regular Expressions1up · 4up NFA simulation · NFA construction
5.5 Data Compression1up · 4up Huffman · LZW
6.4 Maximum Flow1up · 4up Ford–Fulkerson
Linear Programming1up · 4up Simplex