- Hardcover: 486 pages
- Publisher: Springer; Corrected edition (November 14, 1997)
- Language: English
- ISBN-10: 0387948600
- ISBN-13: 978-0387948607
- Product Dimensions: 7.2 x 1.2 x 9.5 inches
- Shipping Weight: 8.8 ounces (View shipping rates and policies)
- Average Customer Review: 30 customer reviews
- Amazon Best Sellers Rank: #886,679 in Books (See Top 100 in Books)
Enter your mobile number or email address below and we'll send you a link to download the free Kindle App. Then you can start reading Kindle books on your smartphone, tablet, or computer - no Kindle device required.
To get the free app, enter your mobile phone number.
The Algorithm Design Manual Corrected Edition
Use the Amazon App to scan ISBNs and compare prices.
Fulfillment by Amazon (FBA) is a service we offer sellers that lets them store their products in Amazon's fulfillment centers, and we directly pack, ship, and provide customer service for these products. Something we hope you'll especially enjoy: FBA items qualify for FREE Shipping and Amazon Prime.
If you're a seller, Fulfillment by Amazon can help you increase your sales. We invite you to learn more about Fulfillment by Amazon .
"Rebound" by Kwame Alexander
Don't miss best-selling author Kwame Alexander's "Rebound," a new companion novel to his Newbery Award-winner, "The Crossover,"" illustrated with striking graphic novel panels. Pre-order today
Frequently bought together
Customers who bought this item also bought
Customers who viewed this item also viewed
"...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
Author interviews, book reviews, editors picks, and more. Read it now
Top customer reviews
There was a problem filtering reviews right now. Please try again later.
The first part of the book is on techniques, and covers the basics of modeling algorithms along with "Big Oh" notation, data structures and sorting, dynamic programming, graph algorithms, combinational search, and the concept of intractibility. What makes this section of the book particularly interesting are the author's "war stories" that talk about real world applications of the ideas discussed in each chapter.
Part two of the book, "Resources", is an extensive catalog of algorithmic problems organized by type. For each problem mentioned, the book includes a problem description and discussion, possible implementations, and other algorithmic problems that are related to this one. In the implementation section for each algorithm, the author demonstrates the kinds of questions that the reader should ask when designing his or her own implementation. The C, C++, Fortran, and Pascal code for all algorithm implementations mentioned is on the accompanying CD rather than in the book itself, which helps make the book more compact.
This book is a very good introduction to the methods of algorithm analysis and design, and an encyclopedic reference on many different types of algorithms. Highly recommended.
It covers a field of fundamentals of computer algorithms. The book explains basic programming mathods, such as dynamic programmind, devide and conquer, backtracking etc.
The book also covers some new fields that are not covered in, for example, Cormens Introduction to Algorithms, such as randomization, genetic algorithms etc.
At the end of the book you can find very interesting catalog of algorithmic problems.
I highly reccomend this book. It is modern and very nice written.
+ : 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.
That having been said: this is a good reference and provides a good "meta-overview" of the basics of algorithms. The Catalog of Algorithmic Problems is a particularly useful tool for quickly locating problems that might be similar to one under consideration and determining (as of 5 years ago, anyway) the approximate state of the art.
I recommend this book, but not unreservedly.
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
Data Structures & Algorithms in Java (Mitchell Waite Signature Series)
by Mitchell Waite, Robert Lafore
Data Abstraction and Problem Solving With
Java: Walls and Mirrors
by Frank M. Carrano, Janet L. Prichard
Most recent customer reviews
The first part mostly contains general advices about algorithms, performances, and such.Read more