Automotive Holiday Deals BOTYKT Shop Women's Dresses Learn more nav_sap_SWP_6M_fly_beacon Indie for the Holidays egg_2015 All-New Amazon Fire TV Luxury Beauty Gifts Under $100 Street Art Project Amazon Gift Card Offer aos aos aos Amazon Echo Starting at $49.99 Kindle Voyage AntMan Outdoor Deals on Amazon.com Deals

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.

  • Apple
  • Android
  • Windows Phone
  • Android

To get the free app, enter your email address or mobile phone number.
Download to your computer
Kindle Cloud Reader

Introduction to the Design & Analysis of Algorithms United States ed Edition

by Anany V. Levitin (Author)
4.5 out of 5 stars 6 customer reviews
ISBN-13: 978-0201743951
ISBN-10: 0201743957
Why is ISBN important?
ISBN
This bar-code number lets you verify that you're getting exactly the right version or edition of a book. The 13-digit and 10-digit formats both work.
Scan an ISBN with your phone
Use the Amazon App to scan ISBNs and compare prices.
Have one to sell? Sell on Amazon

Sorry, there was a problem.

There was an error retrieving your Wish Lists. Please try again.

Sorry, there was a problem.

List unavailable.
Facebook Twitter Pinterest
Buy used
$15.14
Condition: Used - Good
In Stock. Sold by apex_media, Fulfilled by Amazon
Condition: Used: Good
Comment: Ships direct from Amazon! Qualifies for Prime Shipping and FREE standard shipping for orders over $35. Overnight and 2 day shipping available!

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 .

If you're a seller, Fulfillment by Amazon can help you increase your sales. We invite you to learn more about Fulfillment by Amazon .

Access codes and supplements are not guaranteed with used items.
29 Used from $0.16
More Buying Choices
13 New from $18.00 29 Used from $0.16 1 Collectible from $21.75
43 used & new from $0.16
See All Buying Options

There is a newer edition of this item:

Introduction to the Design and Analysis of Algorithms (3rd Edition)
Introduction to the Design and Analysis of Algorithms (3rd Edition)
$123.38
(21)
In Stock.
Free Two-Day Shipping for College Students with Amazon Student Free%20Two-Day%20Shipping%20for%20College%20Students%20with%20Amazon%20Student

Deals in Books

Customers Who Bought This Item Also Bought

Page 1 of 1 Start overPage 1 of 1
This shopping feature will continue to load items. In order to navigate out of this carousel please use your heading shortcut key to navigate to the next or previous heading.
Back
  1. Programming Interviews Exposed: Secrets to Landing Your Next Job
    John Mongan
    4.4 out of 5 stars 81
    Paperback
    $17.05 Prime
  2. Concepts of Programming Languages (9th Edition)
    Robert W. Sebesta
    3.4 out of 5 stars 38
    Hardcover
  3. Coding Puzzles, 2nd edition: Thinking in code
    codingtmd
    5.0 out of 5 stars 1
    Paperback
    $20.12 Prime
  4. Cracking the Coding Interview: 150 Programming Questions and Solutions
    Gayle Laakmann…
    4.6 out of 5 stars 470
    Paperback
  5. Inside the C++ Object Model
    Stanley B. Lippman
    4.7 out of 5 stars 16
    Paperback
    $64.99 Prime
  6. Data Structures Using C
    Aaron M. Tenenbaum
    4.5 out of 5 stars 13
    Hardcover
Next
NO_CONTENT_IN_FEATURE
Hero Quick Promo
Up to 85% Off Over 1,000 Kindle Books
Visit our Holiday Deals store and save up to 85% on more than 1,000 Kindle books. These deals are valid until December 31, 2015. Learn more

Product Details

  • Hardcover: 528 pages
  • Publisher: Addison Wesley; United States ed edition (November 9, 2002)
  • Language: English
  • ISBN-10: 0201743957
  • ISBN-13: 978-0201743951
  • Product Dimensions: 7.7 x 1.1 x 9.4 inches
  • Shipping Weight: 1.4 pounds
  • Average Customer Review: 4.5 out of 5 stars  See all reviews (6 customer reviews)
  • Amazon Best Sellers Rank: #1,493,836 in Books (See Top 100 in Books)

    •  Would you like to update product info or give feedback on images?

Customer Reviews

Most Helpful Customer Reviews

59 of 62 people found the following review helpful
Algorithm Design from a different perspective
By sameer borate on April 27, 2003
Format: Hardcover
As the author says in the preface, there are two ways of presenting algorithms. One classifies algorithms according to a problem type. The other classifies algorithms according to design techniques. A book in the first category will have separate chapters on sorting, searching, graphs etc. These books are like a toolbox. Programmers pick a particular algorithm needed for a problem, modify it if needed and obtain a solution. Most of the algorithm books fall in this category. The problem with this approach is that you have at your disposal only a finite set of algorithms to play with. What if you needed some new kind of algorithm for a specific problem. You are stuck, because most books on algorithms don't teach you how to design new algorithms or what design technique is most suited for your particular problem. It is here that Anany Levitin's book fills the gap. He teaches you the major design techiniques like Brute-Force, Divide-and-Conquer, Greedy techniques. The various algorithms like sorting, searching, graph algorithms are classified according to the various techniques. The advantage of this is that many diverse algorithms get classified according to a particular design technique. For e.g Bubble sort, Convex-Hull problem, Travelling salesman problem, Knapsack problem all fall in the Brute-Force design category. So when you are designing new algorithms you know at the start what type of problem it is and how it should be tackled.
The book teaches you algorithm design and analysis from a completely different view point. It is entertaining to read and the problems at the end of each chapter are wonderful. I only hope that the author adds nore algorithms in his next edition. Go get it!
1 Comment Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback.
Sorry, we failed to record your vote. Please try again
Report abuse
15 of 16 people found the following review helpful
Great Introduction to Algorithmic Design
By British_Bill on May 8, 2005
Format: Hardcover
I recently finished using this book for a course. I found it to be very well written and the presentation was excellent. Most books on algorithms are hard to read and overly mathematical. This book emphasizes more the textual explanation of algorithms for practical applications and not as much on theoretical proofs etc. The exercises at the end of the chapters strongly reinforce the contents and insightful hints to every exercise are given at the end of the book. I thoroughly enjoyed using this book and found it challenging. Other books I used for reference such as the MIT classic Introduction to Algorithms was also useful but much more difficult to understand initially.
Comment Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback.
Sorry, we failed to record your vote. Please try again
Report abuse
9 of 9 people found the following review helpful
A survey of algorithm techniques
By Timothy T. Wee on October 28, 2007
Format: Hardcover
This was my textbook for my algorithms class at UW-Madison.
I like it better than Cormen's book, (introduction to algorithms) I think it's more readable and easy to follow.

A couple of caveats:
1.) This book is more of a survey. It does a deep-dive of some algorithms, but a lot of them only get a high-level description. If you are interested, you will have to look elsewhere for details, etc.

2.) The exercises are very well-written, and very interesting, some of them have been interview questions that I have encountered. The thing is, there is no answer key, and the hints section is not very useful at times.

Still, this book opened my eyes to the beauty of algorithms and math, and the elegance of solutions that are possible for "hard" problems.
After you read this book, you will have an idea of what is possible and it will give you enough ammunition, enthusiasm, and background for digging deeper.
A great collection to pair with is Sedgewick's collection on algorithms, Bundle of Algorithms in Java, Third Edition (Parts 1-5): Fundamentals, Data Structures, Sorting, Searching, and Graph Algorithms, Third Edition which may fill in some of the detail that this book may lack.
1 Comment Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback.
Sorry, we failed to record your vote. Please try again
Report abuse

There's a problem loading this menu right now.

Learn more about Amazon Prime.



Want to discover more products? Check out these pages to see more: algorithm design and analysis, algorithm analysis, intro to design & analysis edition 2nd