🗒 This book covers:

• Part I: Practical Algorithm Design
• - Introduction to Algorithm Design
• - Algorithm Analysis
• - Data Structures
• - Sorting
• - Divide and Conquer
• - Hashing and Randomized Algorithms
• - Graph Traversal
• - Weighted Graph Algorithms
• - Combinatorial Search
• - Dynamic Programming
• - NP-Completeness
• - Dealing with Hard Problems
• - How to Design Algorithms
• Part II: The Hitchhiker’s Guide to Algorithms
• - A Catalog of Algorithmic Problems
• - Data Structures
• - Numerical Problems
• - Combinatorial Problems
• - Graph Problems: Polynomial Time
• - Graph Problems: NP-Hard
• - Computational Geometry
• - Set and String Problems
• - Algorithmic Resources