
- Home
- Books
- Algorithms & Data Structures
- Core Algorithms
- The Algorithm Design Manual, Third edition
The Algorithm Design Manual by Steven S. Skiena is a practical handbook on designing, analyzing, and selecting algorithms for real-world computing problems. Skiena separates algorithmic theory from practical engineering implementation, pairing step-by-step design techniques with a comprehensive catalog of 75 algorithmic problems. The text features candid war stories that illuminate how theoretical algorithms behave under actual industrial constraints.
What you will learn
- Analyze worst-case and average-case performance using asymptotic Big O notation
- Implement fundamental data structures including balanced binary search trees, priority queues, and union-find sets
- Apply core algorithmic paradigms including divide and conquer, dynamic programming, and greedy heuristics
- Model real-world engineering challenges as graph traversals, shortest paths, and minimum spanning trees
- Address computationally intractable NP-complete problems with backtracking and approximation algorithms
- Consult the Hitchhiker's Guide to identify optimal existing algorithms and open-source implementations
Who this is for
Software engineers, algorithm designers, and computer science students preparing for technical interviews or systems development. Familiarity with basic data structures and programming concepts in C, C++, or Java is recommended.


