- Hardcover: 486 pages
- Publisher: Springer; Corrected edition (November 14, 1997)
- Language: English
- ISBN-10: 0387948600
- ISBN-13: 978-0387948607
- Product Dimensions: 7.2 x 1.2 x 9.5 inches
- Shipping Weight: 8.8 ounces
- Average Customer Review: 24 customer reviews
- Amazon Best Sellers Rank: #669,201 in Books (See Top 100 in Books)
Enter your mobile number or email address below and we'll send you a link to download the free Kindle App. Then you can start reading Kindle books on your smartphone, tablet, or computer - no Kindle device required.
To get the free app, enter your mobile phone number.
The Algorithm Design Manual Corrected Edition
Use the Amazon App to scan ISBNs and compare prices.
"Rebound" by Kwame Alexander
Don't miss best-selling author Kwame Alexander's "Rebound," a new companion novel to his Newbery Award-winner, "The Crossover," illustrated with striking graphic novel panels. Learn more
Customers who bought this item also bought
Customers who viewed this item also viewed
What other items do customers buy after viewing this item?
"...the book is an algorithm implementation treasure trove, and putting all of these implementations in one place was no small feat. The list of implementations, an extensive bibliography, and the CD-ROM make the book an invaluable resource for everyone interested in the subject." --ACM Computing Reviews
Top customer reviews
There was a problem filtering reviews right now. Please try again later.
Overall, I found that when confronted to real world problems, the "Algorithm Design Manual" was a better resource than other Algorithm books. This is why I'm recommending it to software engineers out there. It seems to be written for people working with algorithms to solve problems, rather than as a support for an academic course.
On the negative side: I find the resource catalog to be exhaustive but somewhat shallow. As I'm getting older and slower, some things are not as obvious as they used to be. For example, I was quite unable to derive how to use Voronoi diagrams to perform nearest neighbour search, although it is supposed to be "a simple matter".
The first part of the book is on techniques, and covers the basics of modeling algorithms along with "Big Oh" notation, data structures and sorting, dynamic programming, graph algorithms, combinational search, and the concept of intractibility. What makes this section of the book particularly interesting are the author's "war stories" that talk about real world applications of the ideas discussed in each chapter.
Part two of the book, "Resources", is an extensive catalog of algorithmic problems organized by type. For each problem mentioned, the book includes a problem description and discussion, possible implementations, and other algorithmic problems that are related to this one. In the implementation section for each algorithm, the author demonstrates the kinds of questions that the reader should ask when designing his or her own implementation. The C, C++, Fortran, and Pascal code for all algorithm implementations mentioned is on the accompanying CD rather than in the book itself, which helps make the book more compact.
This book is a very good introduction to the methods of algorithm analysis and design, and an encyclopedic reference on many different types of algorithms. Highly recommended.
Well - this book solves it all!
One part contains "war stories", which I found very useful, and amusing - After reading them I felt like I learned many lessons.
The second part, which is the reason I bought this book at the first place, is a very impressive catalog of algorithms and problems - you just need to know something about the problem you need to solve, and most probably, your problem will be described here with clear definitions, and some suggested algorithms for solutions and with resources from other books/articles and web resources.
I tell you - so many times this book was the first and only stop in my persue of finding the algorithm I needed.
I'd recommend this book to anyone studying and working with algorithms. This is a must in your bookshelf - even more - it's a must on your table!
Most recent customer reviews
The first part mostly contains general advices about algorithms, performances, and such.Read more