Introduction to Algorithms: A Creative Approach | 
 enlarge | Author: Udi Manber
Publisher: Addison Wesley
Category: Book
List Price: $95.00
Buy Used: $17.89
You Save: $77.11 (81%)
New (11) Used (18) from $17.89
Rating:  13 reviews
Sales Rank: 434720
Media: Hardcover
Pages: 478
Number Of Items: 1
Shipping Weight (lbs): 1.6
Dimensions (in): 9.1 x 6.2 x 1.2
ISBN: 0201120372
Dewey Decimal Number: 005.73
EAN: 9780201120370
Publication Date: January 11, 1989
Availability: Usually ships in 1-2 business days
Shipping: Expedited shipping available
Shipping: International shipping available
Condition: name inside Buy from the best: 4,000,000 items shipped to delighted customers. We have 1,000,000 unique items ready to ship today!
| |
| Similar Items:
|
| Customer Reviews: Read 8 more reviews...
 a *creative* approach August 26, 2008
N. Girdhar
1 out of 1 found this review helpful
This book is much more than a catalog of algorithms (e.g., CLR): its purpose is to train your intuition to recognize mathematical structure in abstract problems. What does it matter if you know Dijkstra's algorithm? It's much more valuable to have good intuitions and a inductive reasoning tool chest with which to smash apart all of the variations of the shortest path problem (for example.)
The reviewers who wrote that the book "assumes you are a math wiz" and that it provides "little or no guidance for solving an arbitrary problem of the same type" didn't get it. This book is trying very hard to make you into a wiz by forcing you to really interact with mathematics, rather than working through a set of nearly identical problems (--what passes for "education" in North America.)
Complementary to the CLR. April 20, 2008
Komtanoo Pinpimai (Chicago, IL)
I wonder why this book is not as popular as it should be. Although the CLR is the mandatory book of most introduction to algorithm classes, it does not say much of how they came up with those algorithms which is the role of this book. The unique interesting thing is it uses induction to explain how each algorithm was developed, however I guess it's not the primary objective of the author. He wanted readers to read the description of the problems that those algorithms try to solve, and learn to apply induction to solve them on their own. If you like solving puzzle, you will love it.
fantastic October 25, 2003
0 out of 6 found this review helpful
It's a very perfect book to become familiar with main
methods of producing effective algorithms.
 Great on algorithm design, not that good on analysis April 24, 2005
Guilherme D. Fonseca (MD, USA)
5 out of 5 found this review helpful
I like this book a lot. I think it's a good reference and introductory text, maybe as a supplement. It's much easier to read than Cormen's, but not half as deep.
Pros:
- Easy to read. You can understand an algorithm much faster if you go to this book first.
- Good examples and pictures.
- Explain the ideas that lead to efficient algorithmic designs.
Cons:
- Doesn't go into enough details about the proofs of correctness and complexity.
- The approach is different than most books and may take some time to get used to.
Excellent supplemental book April 11, 2001
Raymond B. Jennings III (Ossining, NY USA)
4 out of 4 found this review helpful
This book is a great supplement and not a bad introduction book either. If you find that you still have holes in your knowledge after reading the Cormen book (as I did) you'll find that many of them can be filled with this book. This book also has a better chapter on NP Complete problems than the Cormen book.
|
|
|
