170 books
—
226 voters

Goodreads helps you keep track of books you want to read.

Start by marking “The Algorithm Design Manual” as Want to Read:

# The Algorithm Design Manual

by

This volume helps take some of the "mystery" out of identifying and dealing with key algorithms. Drawing heavily on the author's own real-world experiences, the book stresses design and analysis. Coverage is divided into two parts, the first being a general guide to techniques for the design and analysis of computer algorithms. The second is a reference section, which incl
...more

Hardcover, 486 pages

Published
November 14th 1997
by Springer

## Friend Reviews

To see what your friends thought of this book,
please sign up.

## Reader Q&A

To ask other readers questions about
The Algorithm Design Manual,
please sign up.

Recent Questions

## Community Reviews

Showing 1-30

May 30, 2011
Ivan
rated it
it was amazing
·
review of another edition

Recommends it for:
anyone interested in algorithms and data structures

Shelves:
computer-science

When you want to read a good introductory book about algorithms and data structures the choice comes down to two books: Introduction to Algorithms, Second Edition and this one. I especially liked The Algorithm Design Manual because of the author's writing style, the "war stories" (that are some clever and practical applications of the data structures and algorithms the author tries to teach you) and the second half part of the book which is a sort of encyclopedia of problems.

I used the "introduc ...more

I used the "introduc ...more

Dec 18, 2011
Christian Brumm
rated it
it was amazing
·
review of another edition

Shelves:
cs-software

In comparison to "Introduction to Algorithms" (the other algorithm book I had significant exposure to) this one is faster to read, easier to digest and more tailored towards applications.

I found the "Hitchhiker's Guide to Algorithms" in the back to be extremely useful if you really find yourself tackling an algorithmic problem in practice.

The main part (maybe skipping/skimming down a few chapters) is a very good preparation for algorithm-heavy job interviews (e.g. Google, Facebook etc ...).

Very ...more

I found the "Hitchhiker's Guide to Algorithms" in the back to be extremely useful if you really find yourself tackling an algorithmic problem in practice.

The main part (maybe skipping/skimming down a few chapters) is a very good preparation for algorithm-heavy job interviews (e.g. Google, Facebook etc ...).

Very ...more

The book can be used as a reference that you can use to understand a specific topic.

*exactly*the same. There were some instances (graph algorithms) where the code in Skiena was taken straight out of CLRS. Not only did CLRS explain the algorithm better but it had the proofs to back it up.

Speaking of proofs, this is what I hated about Skiena. It has barely any proofs in comparison to CLRS. A l ...more

Dec 05, 2018
Joe
rated it
really liked it
·
review of another edition

Recommended to Joe by:
Fivebooks

The rare computer programming book that I finished start-to-finish.

The first half of the book tells you why some things take longer to compute than other things. This helps data scientists / statisticians / analysts who work with large amounts of data.

In the first half, the math and the computer code can get pretty heavy. But I found the text around it was written so you could skim the hard stuff, get the idea, and keep going.

The second half of the book is a reference. As Hadley Wickham said in ...more

The first half of the book tells you why some things take longer to compute than other things. This helps data scientists / statisticians / analysts who work with large amounts of data.

In the first half, the math and the computer code can get pretty heavy. But I found the text around it was written so you could skim the hard stuff, get the idea, and keep going.

The second half of the book is a reference. As Hadley Wickham said in ...more

What makes this book better than most other books about the topic is the scrupulous definition of each term, and the absurdly clear explanation of every problem and heuristic that's presented throughout the volume.

Overall, i'd definitely suggest this book to anyone interested in algorit ...more

Something I really like is how he shows how useful graph theory can be. If you can turn your problem into a graph (and you'd be surprised how often you can) there are a lot of non-obvious algorithms that will beat the pants of any non-graphical algorithm. I got a B.A. in math, the most useful class I took was graph theory.

La prima parte è teorica e tratta gli argomenti classici di un corso introduttivo sugli algoritmi: le nozioni di base sulla complessità, sulle strutture dati, gli algoritmi di ordinamento, gli algoritmi sui grafi, la programmazione dinamica, il backtracking, come trattare i problemi "intrattatabili".

In tutta la prima parte sono presenti le cosiddette "War Story": si tratta di paragrafi discorsivi che mostrano l'autore alle prese con problemi pr ...more

The only downside is the author's glib dismissal of the importance of parallel computing and the realities of hardw ...more

It's not as thorough as CLRS, with very little discussion of proofs. Also, it doesn't cover as many data structures or algorithms other than as brief mentions in the huge "Catalog of Algorithmic Problems" that takes up the second half of ...more

Skiena is an engaging writer. The beginning of the book covers algorithms -- such as sorting -- and techniques -- such as simulated annealing and dynamic programming. Then it discusses the importance of getting data structures correct because they influence which algorithms make sense. After a discussion of P vs NP complete vs NP hard (and why a polynomial time solution to ...more

From a practical point of view it is the best algorithms book I've ever seen, and probably a good starting point for every algorithmic problem you might encounter in your career; nonetheless, it's just a starting point, it gives you the right direction but then you'll have to search for more thorough source ...more

**Algorithms**

This is, hands down, the best introductory book to algorithms I have ever read. I've read "Intro to Algorithms" and "Computers and Intractability", and while those two are very good and for some applications better, for the novice algorist or person looking to refresh their knowledge on Data Structures, runtime growth, and popular problems with the algorithms that solve them - I don't think you can do any better than this book.

I enjoyed reading the first part involving his "war stories". However, I would have loved to see examples in C++ or Java or any other modern programming language instead of C.

The second part ""Hitchhiker's Guide to Algorithms" is more for reference that you can refer to if you are stuck with a problem and want to know what to do.

The first is a series of war stories and describes the approaches to problem solving. I found this the most useful part, giving you an insight into how to turn an concrete problem into an abstract problem that maps to an algorithm. The second is a catalogue of various algorithms according to category.

The content is very accessible and less dry than other algorithm books such as CLRS.

The war stories that pepper the book make it a fun, cover-to-cover read, while the cookbook at the end makes it a great reference book.

There are no discussion topics on this book yet.
Be the first to start one »

## Goodreads is hiring!

No trivia or quizzes yet. Add some now »

“In algorithms, as in life, persistence usually pays off.”
—
8 likes

“The issue of finding the best possible answer or achieving maximum efficiency usually arises in industry only after serious performance or legal troubles.”
—
6 likes

More quotes…