Algorithms
18 chapters across 4 books
Introduction to Algorithms
4th Edition
- Approximation Algorithms: Vertex Cover, TSP, and Set Covering→
- Characterizing Running Times: Asymptotic Notation→
- Divide-and-Conquer: Recurrences and Matrix Multiplication→
- Elementary Graph Algorithms: BFS, DFS, and Topological Sort→
- Getting Started: Insertion Sort and Algorithm Design→
- Greedy Algorithms: Activity Selection, Huffman Codes, and Caching→
- Linear Programming: Formulations, Algorithms, and Duality→
- Machine-Learning Algorithms: Clustering, Gradient Descent, and Weights→
- Minimum Spanning Trees: Kruskal and Prim Algorithms→
- Number-Theoretic Algorithms: Modular Arithmetic, GCD, and RSA→
- Online Algorithms: Caching, Search Lists, and Competitive Analysis→
- Parallel Algorithms: Fork-Join, Matrix Multiplication, and Merge Sort→
- Probabilistic Analysis and Randomized Algorithms→
- The Role of Algorithms in Computing→
