Algorithms, 4th Edition

Algorithms

Fundamentals

1.1 Pushdown stack (resizing array)

1.2 Pushdown stack (linked-list)

1.3 FIFO queue

1.4 Bag

1.5 Union-find

Sorting

2.1 Selection sort

2.2 Insertion sort

2.3 Shellsort

2.4 Top-down mergesort

Bottom-up mergesort

2.5 Quicksort

Quicksort with 3-way partitioning

2.6 Heap priority queue

2.7 Heapsort

Symbol Tables

3.1 Sequential search

3.2 Binary search

3.3 Binary tree search

3.4 Red-black BST search

3.5 Hashing with separate chaining

3.6 Hashing with linear probing

Graphs

4.1 Depth-first search

4.2 Breadth-first search

4.3 Connected components

4.4 Reachability

4.5 Topological sort

4.6 Strong components (Kosaraju-Sharir)

4.7 Minimum spanning tree (Prim)

4.8 Minimum spanning tree (Kruskal)

4.9 Shortest paths (Dijkstra)