Flip to back Flip to front
Listen Playing... Paused   You're listening to a sample of the Audible audio edition.
Learn more
See this image
Sell yours for a Gift Card
We'll buy it for $80.26
Learn More
Trade in now
Have one to sell? Sell on Amazon

Introduction to the Design and Analysis of Algorithms (3rd Edition) Paperback – October 9, 2011

ISBN-13: 978-0132316811 ISBN-10: 0132316811 Edition: 3rd
Rent
$27.47 - $27.48
Buy used
$114.57
Buy new
$120.61
Used & new from other sellers Delivery options vary per offer
67 used & new from $97.75
Rent from Amazon Price New from Used from
eTextbook
"Please retry"
$57.90
Paperback, October 9, 2011
"Please retry"
$27.47
$120.61
$116.54 $97.75
Mass Market Paperback
"Please retry"
$36.99
Free Two-Day Shipping for College Students with Amazon Student Free%20Two-Day%20Shipping%20for%20College%20Students%20with%20Amazon%20Student


Hero Quick Promo
Save up to 90% on Textbooks
Rent textbooks, buy textbooks, or get up to 80% back when you sell us your books. Shop Now
$120.61 FREE Shipping. Usually ships within 1 to 3 weeks. Ships from and sold by Amazon.com. Gift-wrap available.

Frequently Bought Together

Introduction to the Design and Analysis of Algorithms (3rd Edition) + Computer Organization and Design, Fifth Edition: The Hardware/Software Interface (The Morgan Kaufmann Series in Computer Architecture and Design)
Price for both: $196.35

One of these items ships sooner than the other.

Buy the selected items together

Editorial Reviews

About the Author

Dr. Anany Levitin graduated from the Moscow State University with an MS degree in Mathematics. He holds a Ph.D. degree in Mathematics from the Hebrew University of Jerusalem and an MS degree in Computer Science from the University of Kentucky.  Introduction to the Design and Analysis of Algorithms has been translated into Chinese, Russian, Greek, and Korean and is used in hundreds of schools all over the world.  Dr. Levitin is also the author of Algorithmic Puzzles, publishing in Fall 2011.

Dr. Levitin teaches courses in the Design and Analysis of Algorithms at Villanova University.
NO_CONTENT_IN_FEATURE

Shop the new tech.book(store)
New! Introducing the tech.book(store), a hub for Software Developers and Architects, Networking Administrators, TPMs, and other technology professionals to find highly-rated and highly-relevant career resources. Shop books on programming and big data, or read this week's blog posts by authors and thought-leaders in the tech industry. > Shop now

Product Details

  • Paperback: 592 pages
  • Publisher: Pearson; 3 edition (October 9, 2011)
  • Language: English
  • ISBN-10: 0132316811
  • ISBN-13: 978-0132316811
  • Product Dimensions: 7.3 x 1.1 x 8.8 inches
  • Shipping Weight: 1.8 pounds (View shipping rates and policies)
  • Average Customer Review: 2.6 out of 5 stars  See all reviews (19 customer reviews)
  • Amazon Best Sellers Rank: #97,394 in Books (See Top 100 in Books)

More About the Author

Discover books, learn about writers, read author blogs, and more.

Customer Reviews

2.6 out of 5 stars

Most Helpful Customer Reviews

7 of 8 people found the following review helpful By C. D. Davis on July 31, 2012
Format: Paperback Verified Purchase
Levitin approaches this broad topic by focusing on design methods first, rather than application. After a brief introduction to efficiency analysis, he moves into elementary methods such as brute force, divide-and-conquer, etc. before broaching more difficult ideas like dynamic programming and greedy technique. In each chapter, most classes of problems that can be solved with the technique are at least mentioned, if not explained in some detail. As a beginner to computer science but having a good amount of programming experience, I was able to pick up the ideas from this book better than from my professor. Bear in mind that this book does not discuss implementation at all, but most algorithms are designed with a C-like or procedural style; you may want to follow up with a book more focused on OO design techniques if you are implementing with C++ or Java. As another reviewer mentioned, there are no solutions to the exercises, but I did find the hints helpful on a few occasions. The solution manual was provided to us by our instructor electronically. The only other complaint is the relatively high cost; this is not a book I plan to keep around for reference due to its limited scope. Nonetheless, as a solid introduction to the field, I found it to be indispensable in my algorithms course.
2 Comments Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback. If this review is inappropriate, please let us know.
Sorry, we failed to record your vote. Please try again
1 of 1 people found the following review helpful By Cullen Clark on April 29, 2015
Format: Paperback
I inherited this book to teach an undergraduate Data Structures and Algorithms course. I would not recommend it.

The gentleman who wrote this book specializes in math, and it shows. While these topics do have a math basis, the courses being taught with it are in Software Engineering and Computer Science. A lot of the topics in here are not practical, and are not presented in an introductory manner. The chapter organization does not actually help in the teaching of a course with the book. While grouping types of algorithms per chapter is interesting, most courses will find themselves wanting to do something such as going over all sorting algorithms together for comparison, and that is a pain to do in this book. When you want all the information on graphs/trees, its spread across most of the book. The terms are defined perhaps 6 chapters before they are practically used. Additionally, the examples and pseudo-code are very math based, and that does not lend to practical experience. It's pretty hard to read at times.

While algorithmic work can get very math focused, this is self-titled introductory. The book fails to be this. It is difficult and boring to read, not practical, and poorly organized. Any book I find I spend more time giving out web links to explain the topics better than the book is not one I would want to use.

If you are a math major and really want to jump into computer science a bit deeper, read this book. I generally cannot recommend it for any other purpose.
Comment Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback. If this review is inappropriate, please let us know.
Sorry, we failed to record your vote. Please try again
1 of 1 people found the following review helpful By Recovering Engineer on January 16, 2015
Format: Paperback
I like the way that this book explains stuff. The language is straightforwards and easy to follow, unlike, for example, CLRS. It also has good refresher tips on the math that you will need for analyzing algorithms, but will probably have forgotten.

However, the latest printing (the 5th, I believe) has the poorest production qualities that I have ever seen in a textbook — particularly one that is priced at $120! The paper is yellowed newsprint, and is so thin that you can read the printing that's on the back of each page. Pearson should be ashamed.
Comment Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback. If this review is inappropriate, please let us know.
Sorry, we failed to record your vote. Please try again
1 of 1 people found the following review helpful By Donabed C. Kopoian on May 13, 2014
Format: Paperback Verified Purchase
Had to buy it for a class. Things are detailed and spelled out. Excellent text book. Lots of filler to go through, but everything you need is there.
Comment Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback. If this review is inappropriate, please let us know.
Sorry, we failed to record your vote. Please try again
2 of 3 people found the following review helpful By Wehbe, T. on March 28, 2014
Format: Paperback Verified Purchase
I had the pleasure to be taught by the write of this book. He perfectly explains each and every algorithm in there. Definitely enjoying this class and enjoying reading this book. The problems presented after each section are interesting to solve.
The shipping was fast and the item received was as described. Satisfied...
Comment Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback. If this review is inappropriate, please let us know.
Sorry, we failed to record your vote. Please try again
By Matiu on May 27, 2015
Format: Paperback Verified Purchase
The paper in this book is so thin that I can see the next two pages as I read, and in addition, it's more of an off white brown color. I wouldn't mind if this was a cheap book, but it's not. For how much money I had to spend on a textbook like this, I at least expect it to be close to quality. I am very disappointed.
Comment Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback. If this review is inappropriate, please let us know.
Sorry, we failed to record your vote. Please try again
Format: Paperback
I like the way that this book describes algorithms. Prof. Levitin is good at explaining complicated contents in an intuitive way, so this book is very easy to follow.
Comment Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback. If this review is inappropriate, please let us know.
Sorry, we failed to record your vote. Please try again
Format: Paperback Verified Purchase
I should have never bought this book, its so hard to follow, I learn way more from my professor's power point slides than the book.
Comment Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback. If this review is inappropriate, please let us know.
Sorry, we failed to record your vote. Please try again