Buy Used
+ £2.80 UK delivery
Used: Good | Details
Condition: Used: Good
Comment: Ships from the USA. Please allow 2 to 3 weeks for delivery. Book has some visible wear on the binding, cover, pages. Biggest little used bookstore in the world.
Trade in your item
Get a £0.90
Gift Card.
Have one to sell?
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

Introduction to the Design and Analysis of Algorithms Paperback – 1 Nov 2005

See all formats and editions Hide other formats and editions
Amazon Price New from Used from
"Please retry"
£37.99 £4.77

Special Offers and Product Promotions

  • When you trade in £15 or more you’ll receive an additional £5 Gift Card for the next time you spend £10 or more.

Trade In this Item for up to £0.90
Trade in Introduction to the Design and Analysis of Algorithms for an Amazon Gift Card of up to £0.90, which you can then spend on millions of items across the site. Trade-in values may vary (terms apply). Learn more

Product details

More About the Author

Discover books, learn about writers, and more.

Product Description

From the Back Cover



Introduction to The Design & Analysis of Algorithms, 2nd Edition

Anany Levitin, Villanova University


Valued by students and trusted by instructors, Introduction to the Design and Analysis of Algorithms employs a comprehensive taxonomy of algorithm design techniques that is more powerful and intuitive than the traditional approach.


It provides a coherent and pedagogically sound framework for learning and teaching algorithms. An extensive, detailed solutions manual is available online for the benefit of students and instructors. Student learning is further supported by exercise hints and chapter summaries. Popular puzzles and games provide motivation for students, and rhetorical questioning serves as an effective learning device.


Ideal for a basic course in the design and analysis of algorithms, this Second Edition features 80 new puzzles and exercises, as well as:

• Separate sections on the analysis of nonrecursive and recursive algorithms

• Coverage of empirical analysis and algorithm visualization

• Revised section on approximation algorithms

• Brand-new chapter on iterative improvement algorithms covering the simplex method, network flows, maximum matching in bipartite graphs, and the stable marriage problem

What Other Items Do Customers Buy After Viewing This Item?

Customer Reviews

There are no customer reviews yet on
5 star
4 star
3 star
2 star
1 star

Most Helpful Customer Reviews on (beta) 15 reviews
23 of 27 people found the following review helpful
Great introductory text! 10 Mar. 2006
By Karl F. Schramm - Published on
Format: Paperback Verified Purchase
For those of you who've always wanted to throw the Cormen text out the window rejoice you finally can! This book is an excellent introduction to algorithms. Though not as thorough as the Cormen text it's orders of magnitude more readable!
9 of 9 people found the following review helpful
Fantastic intro book 26 Sept. 2006
By Sat Garcia - Published on
Format: Paperback
Even though this book is only a few years old, it seems like a well-worn classic. That is not to say that it is outdated and irrelevant; it is exactly the opposite! While my knowledge of algorithms textbooks isn't encyclopedic, I can say that this book was way ahead of the curve in it's layout. Before it, most books presented a bunch of algorithms with some loose affiliations such as being search algorithms or dealing with graphs. This book groups algorithms into major themes and makes it much easier to learn the fundamentals of algorithm design. There have been a new set of algorithms textbooks coming out as late (Kleinberg and Tardos, Dasgupta et al, etc) that have the same approach as this book because it works so well. Don't miss out!
6 of 6 people found the following review helpful
Great basic algorithms book 31 Aug. 2011
By Megan K. - Published on
Format: Paperback Verified Purchase
I've read other algorithm books like Cormen's Introduction to Algorithm's, but The Design and Analysis of Algorithms is by far the best. The chapters are organized by concepts like Greedy and Divide-and-Conquer instead of by problem types like sorting or searching. It was also written using a more conversational tone than your average computer science text, so it was much easier and more interesting to read. Overall, it's a great book that I would definitely recommend for anyone looking to learn or brush up on algorithms!
3 of 3 people found the following review helpful
A good text for a beginner to pickup interest in Algorithms 28 Aug. 2013
By Amshuman - Published on
Format: Paperback
In a nutshell, this is a decent text to start learning about algorithms.

The plus point is the book uses various classifiers (like decrease and conquer, transform and conquer etc) to capture the essence or the basic mechanism of the algorithms. As a subjective preference, I think this is better than providing a list of algorithms in the category of sorting and searching etc.

Also, the book involves a somewhat puzzle solving mindset, which can arouse the interest of any one who likes solving brain teasers.

That said, I get a feeling that the explanations are somewhat brief, sounding more like a high level over view. That style of narration doesn't go very well with me, though this is arguably a subjective preference. I discourage other readers to go by this statement alone, and encourage them to read a chapter or two to make their own assessment of the presentation / narration style.

There are no solutions to the exercises, but there are hints at the end of the book. I find the hints very helpful. However I find lack of solutions to be a draw back. The reason is, I read most of the subjects out of intellectual curiosity and not for academic course work, and hence I like to be able to verify my answers and make sure I am absorbing the material correctly. Frankly, I will feel this way, or more so, even if I am doing an academic course work using this book. Often we understand a subject only when we challenge ourselves; only when we apply the concepts and techniques to various problems. And when we do that, we want some feedback at the end to understand if we did it correctly or not. One philosophical view could be that is what instructors are for, but there are three problems in that way of thinking - (1) Instructors cannot provide enough feedback and coaching in about 30 or so hours of class meetings (2) A student's ability to get such a feedback should not depend so heavily on how well the instructor can do his / her part with problem solving (3) There are many people who are life long learners / self learners, and they are not going to find instructors to coach them. They (like me) respectfully consider authors as their instructors, and the book as the main source of instruction. With that mind set, I like to see solutions to some of the problems if not all. And this book lacks solutions. That's why I am rating this as 4 star (though would like to give 4.5 if I could, the review system doesn't permit fractional ratings)
3 of 3 people found the following review helpful
Crystal clear explainations 7 Jan. 2011
By Charles Zhang - Published on
Format: Paperback
I have a number of algorithm books. But this one taught me the most. Reading this book is just like listening to a good tireless teacher.

The examples in this books are not only very simple but also up to the point. By following the examples, you can mentally follow the algorithms step by step which leads to great understanding of the algorithms.
Were these reviews helpful? Let us know