The Algorithm Design Manual and over one million other books are available for Amazon Kindle. Learn more

Vous voulez voir cette page en français ? Cliquez ici.


or
Sign in to turn on 1-Click ordering.
or
Amazon Prime Free Trial required. Sign up when you check out. Learn More
More Buying Choices
Have one to sell? Sell yours here
Start reading The Algorithm Design Manual on your Kindle in under a minute.

Don't have a Kindle? Get your Kindle here, or download a FREE Kindle Reading App.

The Algorithm Design Manual [Hardcover]

Steven S Skiena
3.3 out of 5 stars  See all reviews (3 customer reviews)
List Price: CDN$ 91.61
Price: CDN$ 73.09 & this item ships for FREE with Super Saver Shipping. Details
You Save: CDN$ 18.52 (20%)
o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o
Only 9 left in stock (more on the way).
Ships from and sold by Amazon.ca. Gift-wrap available.
Want it delivered Friday, May 24? Choose One-Day Shipping at checkout.

Formats

Amazon Price New from Used from
Kindle Edition CDN $65.76  
Hardcover CDN $73.09  
Paperback CDN $72.71  

Book Description

April 27 2011 1848000693 978-1848000698 2nd ed. 2008
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.

Frequently Bought Together

The Algorithm Design Manual + Introduction to Algorithms + Cracking the Coding Interview: 150 Programming Questions and Solutions
Price For All Three: CDN$ 187.52

Show availability and shipping details

  • In Stock.
    Ships from and sold by Amazon.ca.
    This item ships for FREE with Super Saver Shipping. Details

  • Introduction to Algorithms CDN$ 88.13

    In Stock.
    Ships from and sold by Amazon.ca.
    This item ships for FREE with Super Saver Shipping. Details

  • Cracking the Coding Interview: 150 Programming Questions and Solutions CDN$ 26.30

    In Stock.
    Ships from and sold by Amazon.ca.
    This item ships for FREE with Super Saver Shipping. Details


Customers Who Bought This Item Also Bought


Product Details


Product Description

Review

From the reviews of the 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, an extensive bibliography … make the book an invaluable resource for everyone interested in the subject." (ACM Computing Reviews) "My absolute favorite for this kind of interview preparation is Steven Skiena’s The Algorithm Design Manual. More than any other book it helped me understand just how astonishingly commonplace … graph problems are -- they should be part of every working programmer’s toolkit. The book also covers basic data structures and sorting algorithms, which is a nice bonus. … every 1 – pager has a simple picture, making it easy to remember. This is a great way to learn how to identify hundreds of problem types." (Steve Yegge, Steve Yegge’s Blog, March, 2008) "For a decade, Steven Skiena’s Algorithm Design Manual retained its title as the best and most comprehensive practical algorithm guide to help identify and solve problems. It is now available in an improved second edition that is worth buying simply for the updates. … Every programmer should read this book, and anyone working in the field should keep it close to hand. … Would I recommend it? Absolutely. This is the best investment … a programmer or aspiring programmer can make." (Harold Thimbleby, Times Higher Education, November, 2008) "Addressing the main difficulties of solving problems, this book goes far beyond the design of algorithms. It is essential for scientists, engineers, and any professionals who aim to solve problems, with a noticeable emphasis on real problems. It will not only serve as a valuable undergraduate textbook, but it will also become an irreplaceable reference guide for most professionals in the area." (Carlos Linares Lopez, Computing Reviews, February, 2009) "Skiena focuses on the practical aspects of algorithm design and use. … this work fills an important gap in the knowledge of CS practitioners and students. … this book is suitable as a text for an undergraduate algorithms class, but also as an invaluable reference for the practicing programmer. … This second edition has updated the bibliography to include recent works, making it an extensive bibliography. The index is also thorough and very useful for finding specific problems." (William Fahle, ACM Computing Reviews, December, 2008) “Algorithms are the very heart of computing … . This book is about right for most people. … Each of the topics is treated in a readable informal style with lots of asides and accounts of personal experiences - ‘war stories’ in implementing algorithms. … If you want to use it as a course textbook then there are lots of exercises at the end of every chapter. Highly recommended.” (Mike James, I Programmer, September, 2009) “The Algorithm Design Manual by Steven Skiena is aimed at two groups of people: students and professionals. … It is written in an informal style that I found pleasant and engaging. … The book’s unique structure makes it more likely to be immediately useful to the practitioner who has problem to solve and wants to quickly make progress … . the book succeeds admirably. … would be helpful to the student who has never seen this material before. … Overall, I recommend this book warmly.” (Neelakantan Kartha, The Book Review Column, 2011)

From the Back Cover

....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 Reviews "It has all the right ingredients: rich contents, friendly, personal language, subtle humor, the right references, and a plethora of pointers to resources." -- P. Takis Metaxas, Wellesley College "This is the most approachable book on algorithms I have." -- Megan Squire, Elon University, USA 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 ADDITIONAL Learning Tools: • Exercises include "job interview problems" from major software companies • Highlighted take-home lesson boxes emphasize essential concepts • Provides comprehensive references to both survey articles and the primary literature • Exercises point to relevant programming contest challenge problems • Many algorithms presented with actual code (written in C) as well as pseudo-code • A full set of lecture slides and additional material available at www.algorist.com Written by a well-known algorithms researcher who received the IEEE Computer Science and Engineering Teaching Award, this new edition of The Algorithm Design Manual is an essential learning tool for students needing a solid grounding in algorithms, as well as a special text/reference for professionals who need an authoritative and insightful guide. Professor Skiena is also author of the popular Springer text, Programming Challenges: The Programming Contest Training Manual.

Inside This Book (Learn More)
Browse Sample Pages
Front Cover | Copyright | Table of Contents | Excerpt | Index
Search inside this book:

What Other Items Do Customers Buy After Viewing This Item?


Customer Reviews

5 star
0
3 star
0
1 star
0
3.3 out of 5 stars
3.3 out of 5 stars
Most helpful customer reviews
1 of 1 people found the following review helpful
4.0 out of 5 stars Good algorithm recipes book Feb 27 2013
Format:Paperback|Amazon Verified Purchase
I enjoyed reading this book. The introduction to data structures and big O notation is fairly good but the best part is the comprehensive set of algorithms and when to apply them. It is a *big* book, don't expect to read it all in only a few hours (or days).

The code examples are written in C, so you need at least some minimum knowledge on that language (at least, you need to understand how pointers work).

There are quite a lot of errors, some of them very nasty, which could make the reader lose a lot of time. Fortunately there is an errata on-line: [...]
Was this review helpful to you?
1 of 1 people found the following review helpful
4.0 out of 5 stars One of the Best Algorithm Books Feb 6 2013
By Y. Lu
Format:Hardcover|Amazon Verified Purchase
This book has covered most, if not all, of the fundamental topics in computer science at Bachelor of Science level, some selected topics in graduate level. Dr. Skiena did a very good job of explaining many of the subjects (concepts, data structures and algorithms) in a clear and concise manner. I like the most about his coverage on Data Structure and Graph. Some of the highlights of this book:

1. Uses both pseudo code and actual programming language (C or C++) in explaining and demonstrating data structures and algorithms, this helps get ride of many of the ambiguities of only using pseudo code. The actual code is well designed and developed, and companion web site has copies of source code available for download.

2. I love the exercises presented in this book, they are well crafted problems, very helpful in reinforcing the learning process.

I am not quite sure about the "war stories" sections of the book, they are woven into the book, some of them help reader to appreciate the power of algorithms, but I think many of them were much more complex stories/problems that need a much detailed presentation in order for the users to get the full picture of the story. In general, I think the book will just be as good without these sections.

By the way, I think prior reader experience with algorithm and programming will help reader to get the best out of the book.
Was this review helpful to you?
0 of 1 people found the following review helpful
2.0 out of 5 stars not sure about this book Jan 17 2013
Format:Hardcover|Amazon Verified Purchase
First impression fails: It starts with an inefficient (bad) implementation of insertion sort (bubbles each target element leftward through the sorted invariant).

Then goes into weird implementations of linked list operations.

For example: Why you do this for list_delete?

1) a helper function recursively goes through list and finds the element before the element to delete
2) another helper function recursively goes through list and finds the element to delete
3) actual delete function calls 1 and 2 and does some handling of the "delete first element" case and then jiggles pointers based on return values of 1) and 2) to delete under the "not first element" case

Like this a lot of the code is not implemented well.

The book is great for the non-coding parts though, to get a general sense for types of algorithms (i.e., second part of the book).
Was this review helpful to you?
Want to see more reviews on this item?
Search Customer Reviews
Only search this product's reviews

Listmania!


Look for similar items by category


Feedback


Amazon.ca Privacy Statement Amazon.ca Shipping Information Amazon.ca Returns & Exchanges