The Algorithm Design Manual

by Steven S. Skiena and Steve S. Skiena

Book Overview

"My absolute favorite for this kind of interview preparation is Steven Skiena's The Algorithm Design Manual. More than any other book it helped me understand just how astonishingly commonplace ...... This description may be from another edition of this product.

• Format: Hardcover
• Language: English
• ISBN: 1848000693
• Release Date: October 2008
• Publisher: Springer-Nature New York Inc
• Length: 730 Pages
• Weight: 3.55 lbs.
• Dimensions: 9.3" x 1.4" x 7.3"

Customer Reviews

Covers an Important Middle Ground

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.

Very useful

I have bought this book for "on the job" use and it is coming in very handy. We had a confusing problem concerning a matrix and the solution was here with examples. This sort of thing really impresses me about a book because it is paying for itself.

Useful resource!

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!

You will love it!

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

The hitch-hiker's guide to Algorithms.

The Catalog was my main reason for buying the book. It's an invaluable reference base for people whose boss 'needs an answer by tomorrow'.+ : The War Stories are fun reading, and do a good job of explaining how theory relates to practice. - : Restating the obvious at times, while deliberately vague elsewhere. Net : if you use a greedy heuristic to select your reading, this book probably comes ahead of the pack.