Search  for anything...
NA

The Algorithm Design Manual

  • Based on 550 reviews
Condition: New
No images found
Checking for the best price...
$63.20 Why this price?

Buy Now, Pay Later

As low as $10.53 / mo
  • – 6-month term
  • – No impact on credit
  • – Instant approval decision
  • – Secure and straightforward checkout

Ready to go? Add this product to your cart and select a plan during checkout.

Payment plans are offered through our trusted finance partners Klarna, PayTomorrow, Affirm, Afterpay, Apple Pay, and PayPal. No-credit-needed leasing options through Acima may also be available at checkout.

Learn more about financing & leasing here.

Selected Option

Free shipping on this product

This item is eligible for return within 30 days of receipt

To qualify for a full refund, items must be returned in their original, unused condition. If an item is returned in a used, damaged, or materially different state, you may be granted a partial refund.

To initiate a return, please visit our Returns Center.

View our full returns policy here.

Availability: In Stock.
Fulfilled by Amazon
Arrives Wednesday, Sep 3
Order within 3 hours and 30 minutes
Available payment plans shown during checkout

Recently Viewed

Format: eTextbook


Description

This newly expanded and updated second edition of the best-selling classic continues to take the "mystery" out of designing algorithms, and analyzing their efficacy and efficiency. Expanding on the first edition, the book now serves as the primary textbook of choice for algorithm design courses while maintaining its status as the premier practical reference guide to algorithms for programmers, researchers, and students.The reader-friendly Algorithm Design Manual provides straightforward access to combinatorial algorithms technology, stressing design over analysis. The first part, Techniques, provides accessible instruction on methods for designing and analyzing computer algorithms. The second part, Resources, is intended for browsing and reference, and comprises the catalog of algorithmic resources, implementations and an extensive bibliography.NEW to the second edition:• Doubles the tutorial material and exercises over the first edition• Provides full online support for lecturers, and a completely updated and improved website component with lecture slides, audio and video• Contains a unique catalog identifying the 75 algorithmic problems that arise most often in practice, leading the reader down the right path to solve them• Includes several NEW "war stories" relating experiences from real-world applications• Provides up-to-date links leading to the very best algorithm implementations available in C, C++, and Java Read more


Publisher ‏ : ‎ Springer; 2nd edition (April 5, 2009)


Publication date ‏ : ‎ April 5, 2009


Language ‏ : ‎ English


File size ‏ : ‎ 7076 KB


Text-to-Speech ‏ : ‎ Enabled


Enhanced typesetting ‏ : ‎ Not Enabled


X-Ray ‏ : ‎ Not Enabled


Word Wise ‏ : ‎ Not Enabled


Sticky notes ‏ : ‎ Not Enabled


Frequently asked questions

If you place your order now, the estimated arrival date for this product is: Wednesday, Sep 3

Yes, absolutely! You may return this product for a full refund within 30 days of receiving it.

To initiate a return, please visit our Returns Center.

View our full returns policy here.

  • Klarna Financing
  • Affirm Pay in 4
  • Affirm Financing
  • Afterpay Financing
  • PayTomorrow Financing
  • Financing through Apple Pay
Leasing options through Acima may also be available during checkout.

Learn more about financing & leasing here.

Similar Products

Top Amazon Reviews

    • GREAT for Self Study OR Reference
This text strikes a perfect balance between too complex and too simple-- with hundreds of practical techniques that give a great overview of nearly every type of algorithm problem we encounter. This is NOT a "theory" text about big Oh (although it has a chapter), efficiency, p vs np and advanced calculus and linear algebra, but does show practical ways to design algorithms and answer questions in that interview. As an example, older calculators always started "high" when finding quadratic factors or square roots. Skiena (p. 134) shows that three possible "front ends" can make subsequent iteration (trial and error until you're done) faster and more efficient: 1. The older always start high method 2. A common bisection technique-- split the problem, then, by "divide and conquer" go higher or lower and 3. Use interpolation to get closer sooner, then iterate. The book is set up both as a self study and year long course text, but frankly the presentation is far from academic and much more rubber hits the road practical, realistic, design. The background is given with pseudocode, then the basic level of math needed to get the job done without pages of theory and proofs of Big Oh efficiency, etc. Since 2008, the next edition in 2010, and this 2012 "printing corrections" edition (not considered a true edition, but contains many detailed corrections), this book has found a great audience in interview prep, because the author takes such a real world approach to solutions. Make sure you get the corrected edition if you buy from an Amazon third party vendor, you will if you get it directly from Amazon. Highly recommended for all levels of programmers. The index also has been updated, and some of the previous reviews pointing out errors corrected, making this an outstanding reference. As if 700 pages weren't enough, the author also provides 19 sections of practical reviews of online resources and a detailed 43 page very current bib. If you're looking for a difficult to find "vein" of info (say, for example, on CAS algos), you'll find a wealth of info in these sections. Many volumes call themselves cookbooks, this really IS the best of that genre. If you can afford only one algo book, and want to use it without a tutor, teacher or coach, this is the one. Don't take that to mean it's simple-- it's just as deep as the academic texts, but simply removes all the math you don't use every day anyway. It's really more for programmers than researchers, but researchers would still learn a lot about how practical algo writers frame problems. Library Picks reviews only for the benefit of Amazon shoppers and has nothing to do with Amazon, the authors, manufacturers or publishers of the items we review. We always buy the items we review for the sake of objectivity, and although we search for gems, are not shy about trashing an item if it's a waste of time or money for Amazon shoppers. If the reviewer identifies herself, her job or her field, it is only as a point of reference to help you gauge the background and any biases. ... show more
Reviewed in the United States 🇺🇸 on April 11, 2013 by Tommy Chess Coach
    • Great Content, Occasionally Out-of-Touch Author
I'd mildly recommend most of this book. It's an accessible approach to the field of study and shies away from mathematical notation that makes a lot of similar textbooks hard to read as an adult engaged in independent study. The author is fond of lucid and effective examples that make it easy to grasp the basic concept of a lot of otherwise opaque/obscure algorithms. My one complaint is the odd tone that emerges from a lot of the "war stories," where the author often positions himself as the all-knowing and seasoned teacher and consultant, tasked with addressing the foolish mistakes of his business partners and graduate students. It's probably an accident (he's just reporting the facts from his own life), but there are some unhelpful tropes that creep into these stories, like the foolish female student and the Asian students who all seem to look alike. Overall, I didn't hate the book. I haven't read any of its competitors, so I can't speak to its global merits. I would recommend it, but not so strongly that I would discourage you from look at the other options and deciding what makes sense for you. ... show more
Reviewed in the United States 🇺🇸 on April 22, 2020 by Ryan Mease
    • Best Intro To Algorithms
I've read through the first half of the book, and am now at the catalog of algorithms that makes up the second half, and I've really enjoyed the book so far. Most books on algorithms take a very formal, math heavy approach in which they present, analyze and prove things about a somewhat arbitrary collection of algorithms. There's usually no mention of real world applications. This book, however, takes a different approach, and serves as a guide book for using algorithms in the real world. There's a heavy emphasis on formulating problems in terms of existing, solved problems. If you can "map" your problem to one with a known solution, then you can use the proven, existing solution to solve your problem. To emphasize that point, roughly the entire second half of the book is a catalog of known problems and solutions, with references to software libraries, books and other sources of information. I also love that the example code is in C. Too many books give example code in languages with a lot of overhead, like Java, and end up obscuring the important parts with a ton of object-oriented crap. Yes - OOP is nice, but unless I'm reading a book on OOP, I don't want to dig through 30 lines of irrelevant boilerplate just to find the 10 lines relevant to the algorithm. That said, it's not the best code in the world. Some of the snippets could be explained better. And there were a few stylistic issues, such as leaving off function return types and a bunch of global variables, that I didn't like, but I'm willing to forgive those because it's not a book on C, and the lack of syntactic clutter made the algorithm easier to see. I also thought chapter nine was a bit too long. A good portion of the chapter is spent reducing various NP-complete problems to other NP-complete problems. Interesting, but it was a bit too theoretical, and didn't really fit with the with the rest of the book. ... show more
Reviewed in the United States 🇺🇸 on October 26, 2009 by Jeremiah LaRocco

Can't find a product?

Find it on Amazon first, then paste the link below.
Checking for best price...