This book is probably the most popular book in the Competitive Programming community. The Algorithm Design Manual provides straightforward access to combinatorial algorithms technology, stressing design over analysis.
Part I - Techniques
provides accessible instruction on methods for designing and analyzing computer algorithms.
Algorithm Analysis
Data Structures
Sorting and Searching
Graph Traversal & Weighted Graph Algorithms
Combinatorial Search & Heuristic Methods
Dynamic Programming
Intractable Problems & Apporoximation Algorithms
Part II - Resources
is a catalog of famous algorithmic problems and suggested implementations.
Advanced Data Structures
Numerical Problems
Combinatorial Problems
Graph Problems: Polynomial-Time
Graph Problems: Hard Problems
Computational Geometry
Set and String Problems
It is recommended that one has a solid foundation of algorithms and data structures before using this book. For a more beginner-friendly introduction, refer to Cormen's Introduction to Algorithms (2nd edition) or Sedgewick's Algorithms (4th edition).
About the author
Steven Skiena is a Distinguished Teaching Professor of Computer Science at Stony Brook University of New York
(SUNY
).
He was co-founder and the Chief Science Officer of General Sentiment, a social media and news analytics company. His research interests include algorithm design, data science and their applications to biology.
Skiena is the author of several popular books in the fields of algorithms, programming, and data science. The Algorithm Design Manual is widely used as an undergraduate text in algorithms and within the tech industry for job interview preparation.
This book is probably the most popular book in the Competitive Programming community. The Algorithm Design Manual provides straightforward access to combinatorial algorithms technology, stressing design over analysis.
Part I - Techniques
provides accessible instruction on methods for designing and analyzing computer algorithms.
Algorithm Analysis
Data Structures
Sorting and Searching
Graph Traversal & Weighted Graph Algorithms
Combinatorial Search & Heuristic Methods
Dynamic Programming
Intractable Problems & Apporoximation Algorithms
Part II - Resources
is a catalog of famous algorithmic problems and suggested implementations.
Advanced Data Structures
Numerical Problems
Combinatorial Problems
Graph Problems: Polynomial-Time
Graph Problems: Hard Problems
Computational Geometry
Set and String Problems
It is recommended that one has a solid foundation of algorithms and data structures before using this book. For a more beginner-friendly introduction, refer to Cormen's Introduction to Algorithms (2nd edition) or Sedgewick's Algorithms (4th edition).
About the author
Steven Skiena is a Distinguished Teaching Professor of Computer Science at Stony Brook University of New York
(SUNY
).
He was co-founder and the Chief Science Officer of General Sentiment, a social media and news analytics company. His research interests include algorithm design, data science and their applications to biology.
Skiena is the author of several popular books in the fields of algorithms, programming, and data science. The Algorithm Design Manual is widely used as an undergraduate text in algorithms and within the tech industry for job interview preparation.