176 books
—
246 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

## Get A Copy

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

Start your review of The Algorithm Design Manual

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

*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

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

I liked that algorithms were not presented in vacuum. Quite the opposite. A lot of attention is placed on practical applications of algorithms. Author talks a lot about ways to recognize that many popular problems can be solved using popular algorithms.

In my opinion, this book has a very pragmatic approach. It doesn't go into details of flavors of algorithms that most de ...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

This book, like most academic books, is hard to read and comprehend and needs the reader to do more research about the subjects. I wish people who write these books, they come out of thei ...more

Every chapter starts off with a problem statement, then questions are asked to help identify hidden nuances of the problem, followed by a "War story" showing where exactly that particular algorithm found it's application and tricky exercises of course.

Author provides dozens of references to each topic so the reader could study the particular subject in deta ...more

Unlike most algorithm books designed and written as textbooks, to be followed step by step from start to finish with each chapter delving into a class of algorithms in the curriculum, this seemed more a collection of interesting problems the author himself came across, that and he felt were instructive and worth sharing.

That is, it has more to do with interesting problems and the approach that goes into designing algor ...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

I don't know if this book could be read with someone with zero knowledge of the topics involved. I am a graduate student of electrical engineering who knew a reasonable lot before trying this book out and, still, couldn't read more than 40-60 pages a day (I separated 2 weeks off for this ...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.

Jun 16, 2019
Natu Lauchande
added it

Good go to book for algorithms !!!

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

## Goodreads is hiring!

## Related Articles

If you haven't heard of record-smashing singer and songwriter Mariah Carey, is there any hope for you? Who else has sold more than 200 million...

47 likes · 20 comments

No trivia or quizzes yet. Add some now »

“In algorithms, as in life, persistence usually pays off.”
—
10 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…