The Algorithm Design Manual (Hardcover)

~ Steve S. Skiena (Author) "What is an algorithm?..." (more)
Key Phrases: algorithm animation system, convex hull code, friendship graph, United States, Stony Brook, Monte Carlo (more...)

Editorial Reviews

Review

"...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 bibiliography, and the CD-ROM make the book an invaluable resource for everyone interested in the subject." -- ACM's Computing Reviews

"...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

Product Description

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 includes a catalog of the 75 most important algorithmic problems. By browsing this catalog, readers can quickly identify what the problem they have encountered is called, what is known about it, and how they should proceed if they need to solve it. This book is ideal for the working professional who uses algorithms on a daily basis and has need for a handy reference. This work can also readily be used in an upper-division course or as a student reference guide.

THE ALGORITHM DESIGN MANUAL comes with a CD-ROM that contains: * a complete hypertext version of the full printed book. * the source code and URLs for all cited implementations. * over 30 hours of audio lectures on the design and analysis of algorithms are provided, all keyed to on-line lecture notes.

See all Editorial Reviews

Product Details

• Hardcover: 504 pages
• Publisher: Springer; Corrected edition (July 31, 1998)
• Language: English
• ISBN-10: 0387948600
• ISBN-13: 978-0387948607
• Product Dimensions: 9.2 x 7.1 x 1.2 inches
• Shipping Weight: 2.1 pounds
• Average Customer Review: 4.5 out of 5 stars  See all reviews (34 customer reviews)
• Amazon.com Sales Rank: #460,100 in Books (See Bestsellers in Books)

Customer Reviews

Most Helpful Customer Reviews

45 of 45 people found the following review helpful:

5.0 out of 5 stars Covers an Important Middle Ground, March 6, 2003

By	Jason (Illinios) - See all my reviews

This book fills a nice niche -- it is practical enough to be useful and accesible to professional programmers (rather than algorithms researchers or academics) but is build on solid theory as well.

Aside from this, the book has several features to recommend it:
(1) There are "war stories" scattered throughout the text. These are special sections that describe the author's experience working with algorithmic problems "in the field". These are particularly interesting because the present false starts and failures along the way to the final solution. This is a nice change from the standard model of simply presenting algorithms and proving them correct.

(2) Unlike others, such as the popular Cormen, Lieserson, Rivest and Stein text -- which is a bit advanced for beginning study -- this really is an introduction to algorithms. It is quite suitable for, say, undergradutes who have taken a couple of basic CS courses.

(3) Chapter 8 is a 250-page "Catalog of Algorithmic Problems". Here, you will find descriptions of hundreds of standard formulations for algorithmic problems along with the basic solution approaches, and -- this is what really sets it apart -- pointers to implementations of these algorithms. This is part of the overall emphasis of the book: that of understanding standard algorithms in order to avoid "reinventing the wheel".

Overall, I recommend this book for people with some programming experience that would like to take their work to the next level. Hardcore computer scientists (especially those with a more theoretical bent) may also benefit from this book, but should consider it a supplement to one of the more advanced texts, such as the above-mentioned CLRS.

38 of 38 people found the following review helpful:

5.0 out of 5 stars You will love it!, March 20, 2001

By	Nikos Kanellopoulos (Athens, Greece) - See all my reviews

Apart from beeing really useful, this book has two more interesting characteristics: 1. it is very readable 2. it is very amusing/interesting at times. The book is very good if you are a beginner in the subject of computer algorithms, but note that it is not a stand-alone book. You also need a good algorithms textbook to cover the subject of algorithms. Skiena reviews some aspects of the algorithmic theory he regards especially useful/important and presents his interesting perspective, but some times he uses algorithms or techniques he has not presented. What makes this book great is the "War stories", where the author describes real problems and the process that led to the algorithm that solved the problems. Something like Bentley's magnificent book "Programming pearls" (get this one too!). And, of course, the categorized catalog of algorithmic problems, which comprises the bigest part of the book, is almost a guarantee that once you come across a real problem you will shortly know where to look for a solution. Moreover, that solution may already be coded, waiting for you in the CD that comes with the book (which also includes a one-semester lectures of the author in shockwave-audio format).

26 of 29 people found the following review helpful:

5.0 out of 5 stars Useful resource!, October 2, 2001

By	Shlomo Yona (Israel) - See all my reviews (REAL NAME)

In my line of work I am, many times, in need of some algorithm or resource to do some job. Sure I learned many during my B.Sc. studies, and during my work, but some are hard to remember, and some I never knew - and sometimes you just need to know how to call the problem in order to locate resources about it from the internet.

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!