The Algorithm Design Manual
On April - 27 - 20105 COMMENTS
Product Description
….The most comprehensive guide to designing practical and efficient algorithms!…. The Algorithm Design Manual, Second Edition “…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 [and] extensive bibliography make the book an invaluable resource for everyone interested in the subject.” –ACM Computing ReviewsMore >>
This is the worest textbook that i hae ever seen! Do not apend ur money on it.
Rating: 1 / 5
Newt Gingrich is given the job of partitioning
Rating: 5 / 5
Este libro es senciallamente expectacular y creo que es la biblia de la algoritmia moderna.
Rating: 5 / 5
I’m a numerics guy. This means I am generally interested in solving problems with solutions which are well modeled by real numbers. Algorithms involving real numbers mostly run on the floating point side of your CPU. I got interested in this sort of thing because my main intellectual interests involve solving problems with involve the “real world.” Puns aside; I like thinking about problems in dynamics, signal processing, modeling quantum mechanical systems: the things most people think of as encompassing “reality.” Computers can’t really model real numbers, but then, a lot of the time, real numbers are just a convenience for modeling things which work long a logarithmic length scale. “Real” stuff works this way. Scientists who concern themselves with this sort of problem will often learn all about clever tricks for using the floating point part of their processor as a result.
Eventually, if you get deep enough, you need to take full advantage of the integer side of the machine. The integer side of the machine has been the primary concern of computer scientists over the years, since that’s how computers really work inside. Guys like me who learned all about the floating point end of things are often in the dark as to what is possible in Integer-land. This book is an outstanding guidebook to what is possible using integer related tricks. In this book, you’ll learn all about “big O,” graph traversals, trees, hash functions, search and P versus NP. A lot of guys like me have only a vague grasp that such things exist. This is a great book for educating yourself as to what is possible, and the general principles of how all this stuff works. What is more, the text is interesting, profusely illustrated with useful visual aids and is written in a wonderfully clear style. I wish such a thing existed for the floating point side of things (Numerical Recipes don’t count; it’s a much different book), but it was certainly very helpful to me that this exists. A must read if you’ve never taken an “algorithms and data structures” course, but use a computer at a serious level.
Rating: 5 / 5
I hate to give this book only 3 stars, since it is obviously so well done. But it is not a book for everyone. If you are at the advanced level, you will treasure this one.
But if you want to learn practical algorithms at a more basic level, I recommend:
Algorithms in C++, Parts 1-4: Fundamentals,
Data Structure, Sorting, Searching (3rd Edition)
by Robert Sedgewick
or
Data Structures & Algorithms in Java (Mitchell Waite Signature Series)
by Mitchell Waite, Robert Lafore
or
Data Abstraction and Problem Solving With
Java: Walls and Mirrors
by Frank M. Carrano, Janet L. Prichard
Rating: 3 / 5