C++ Algorithms

Practicing algorithms from Introduction to Algorithms

---

Index

1. Foundations
   1. The Role of Algorithms in Computing
   2. Getting Started
      • Insertion Sort
      • Merge Sort
   3. Growth of Functions
   4. Divide & Conquer
      • Max SubArray Problem
      • Square Matrix Multiplication
   5. Probability Analysis and Randomized Algorithms
2. Sorting & Order Statistics
   6. Heap Sort
   7. Quick Sort
   8. Sorting in Linear Time
      • Bucket Sort
      • Counting Sort
      • Radix Sort
   9. Medians and Order Statistics
3. Data Structures
   10. Elementary Data Structures
       • Queue
       • Queue Circular
       • Queue Linked List
       • Stack
       • Stack Linked List
   11. Hash Tables
   12. Binary Search Tree
   13. Red-Black Trees
   14. Augmenting Data Structures
4. Advance Design and Analysis Techniques
   15. Dynamic Programming
       • Coin Change
       • Edit Distance
       • Knapsack Discrete Without Repetition
       • Knapsack Discrete With Repetition
       • Longest Common Subsequence
       • Rod Cutting
   16. Greedy Algorithms
       • Activity Selection Problem
       • Coin Change
       • Fractional Knapsack Problem
       • Huffman Code
   17. Amortized Analysis
5. Advanced Data Structures
6. Graph Algorithms
   22. Elementary Graph Algorithms
       • BFS
       • DFS
       • Topological Sort
   23. Minimum Spanning Trees
       • Kruskal
       • Prim
   24. Single Source Shortest Paths
       • Bellman Ford
       • DAG Shortest Path
       • Djkstra

---

Book's cover page: