| | |  | Wireless Security | Home » » The Algorithm Design Manual | | | | | | | Description: | | This expanded and updated second edition of a classic bestseller continues to take the "mystery" out of designing and analyzing algorithms and their efficacy and efficiency. Expanding on the highly successful formula of the first edition, the book now serves as the primary textbook of choice for any algorithm design course while maintaining its status as the premier practical reference guide to algorithms. NEW: (1) Incorporates twice the tutorial material and exercises. (2) Provides full online support for lecturers, and a completely updated and improved website component with lecture slides, audio and video. (3) Contains a highly unique catalog of the 75 most important algorithmic problems. (4) Includes new "war stories" and "interview problems", relating experiences from real-world applications. Written by a well-known, IEEE Computer Science teaching-award winner, this new edition is an essential learning tool for students needing a solid grounding in algorithms, as well as a uniquely comprehensive text/reference for professionals. | | | Product Details: | | | Author:
| Steven S. Skiena | | Hardcover:
| 752 pages | | Publisher:
| Springer | | Publication Date:
| July 26, 2008 | | Language:
| English | | ISBN:
| 1848000693 | | Product Length:
| 9.41 inches | | Product Width:
| 7.21 inches | | Product Height:
| 1.42 inches | | Product Weight:
| 3.5 pounds | | Package Length:
| 9.5 inches | | Package Width:
| 7.3 inches | | Package Height:
| 1.3 inches | | Package Weight:
| 3.2 pounds | | Average Customer Rating:
|  based on 24 reviews |
| | | | Customer Reviews: | |
Average Customer Review:
 ( 24 customer reviews )
Write an online review and share your thoughts with other customers.
Most Helpful Customer Reviews
30 of 35 found the following review helpful:
 Could be called "The Joy of Algorithms"Dec 31, 2009
By George H.
My Dad loved to cook and one of his favorite cookbooks was "The Joy of Cooking." By the time he died, the pages of his copy were stained and dusted with flour from being constantly used in his kitchen.
Why did he like it so much? Because not only did it have great recipes, it also explored the basic ingredients and methods and told interesting stories about cooking.
That's why "The Algorithm Design Manual" could be called "The Joy of Algorithms." Not only has it become my "goto" book for finding the right algorithmic approach to a problem, it is a joy to read with Skiena's "war stories" and his lively writing style.
Just like my Dad's "The Joy of Cooking" was never far from his stove, "The Algorithm Design Manual" will never be far from my computer.
13 of 14 found the following review helpful:
 Great book. Maybe a beginner book, but not for comp sci novices!Oct 03, 2010
By E. Jones
I've got the Cormen book as well, which I love. This book is a much more readable text, by far. I think that others here have broken down the areas covered quite well; so I'll just give a stream of consciousness version of what I liked about the book.
It gives the subject matter with from a need to know standpoint. It also gives you real world examples of how the author has had to utilize algorithms not just to implement a particular solution, but to also optimize existing solutions. Although it doesn't give the hardcore theoretical breakdowns in Cormen's text, don't think that the subject matter is presented in a lightweight format. You will still be given some level of mathematical proof for some algorithms and data structure optimizations.
Although less terse than the typical text on Algorithms, it doesn't try too hard to be cute and quirky. The humor is well placed and not too overbearing.
Though less academic than "Introduction To Algorithms", this ain't the book to pickup to learn about coding algorithms for a quick study prior to an interview. However, if you're planning to get ready for interviews maybe a few months down the road...go for it!
A caveat...I got the Kindle version for the Android, which is none too forgiving when it comes to images. So diagrams look horrible on the phone (even with the DroidX's big-assed screen). It looks fine on the laptop, however.
Enjoy!
8 of 9 found the following review helpful:
Well organized detailsJun 06, 2009
By Tech Book Addict
I needed to understand some best fit algorithms and alternatives without reading a whole numbing book. The organization of this book and the right level of detail help me get there.
4 of 4 found the following review helpful:
Good material - Index sucksApr 06, 2011
By Jason Schorn
"j schorn"
I recently bought the second edition in order to do some personal research and, as such, did not plan on reading the book from cover-to-cover. I intend to use the book as a reference and therefore utilize mainly the index and, to a lesser extent, the table of contents. Yes the material is this book is, in general, sufficient, but the index is bogus. The following presents some examples in order to valid my claim (again, I am referring to the second edition and I am NOT making any claims against the first edition):
(1) Splines --> p. 294 --> Intro to numerical problems with no reference to splines.
(2) Lisp --> p. 409 --> Section on (un)constrained optimisation - no Lisp.
(3) Linked lists -->
(3a) only mentioned in terms of linked lists vs arrays. Correct on p. 368
(3b) p. 72 --> Section stacks/queues or dictionaries. It should refer to pg. 70
My only other complaint (so far) is rather minor and came about while reading the first chapter. In particular, section 1.3.4 on Induction and recursion where the author attempts to use induction in order to prove some function Increment(y). Technically the author is using strong induction and not mathematical induction.
These are just some of the examples of how Springer and their talented editorial staff goofed up, not a representative picture meant to portray the book as an overall failure. As mentioned previously, I would highly recommend this book provided you can get over a faulty index and are not overly pedantic when it comes to someone elses use of Mathematical terminology.
3 of 3 found the following review helpful:
Excellent reference and study bookAug 26, 2010
By Eric M. Wendelin
This book is by far the best algorithms book I've read.
Two major reasons for this: the sections include many considerations when choosing algorithms/data structures, and the number of war stories showing how such decisions were made in real situations.
I would recommend this text to anyone that writes software seriously.
See all 24 customer reviews on Amazon.com
| | |
|
