• RRP: £53.99
  • You Save: £5.00 (9%)
FREE Delivery in the UK.
Only 2 left in stock (more on the way).
Dispatched from and sold by Amazon.
Gift-wrap available.
Quantity:1
Introduction to the Desig... has been added to your Basket
Condition: Used: Good
Comment: Used Good condition book may have signs of cover wear and/or marks on corners and page edges. Inside pages may have highlighting, writing and underlining. All purchases eligible for Amazon customer service and a 30-day return policy.
Trade in your item
Get a £0.27
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 (International Version) Paperback – 16 Dec 2011


See all 4 formats and editions Hide other formats and editions
Amazon Price New from Used from
Kindle Edition
"Please retry"
Paperback
"Please retry"
£48.99
£24.99 £8.89
£48.99 FREE Delivery in the UK. Only 2 left in stock (more on the way). Dispatched from and sold by Amazon. Gift-wrap available.

Frequently Bought Together

Introduction to the Design and Analysis of Algorithms (International Version) + Introduction to Algorithms
Price For Both: £84.59

Buy the selected items together

Trade In this Item for up to £0.27
Trade in Introduction to the Design and Analysis of Algorithms (International Version) for an Amazon Gift Card of up to £0.27, 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

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.
--This text refers to an out of print or unavailable edition of this title.

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

What Other Items Do Customers Buy After Viewing This Item?

Customer Reviews

There are no customer reviews yet on Amazon.co.uk.
5 star
4 star
3 star
2 star
1 star

Most Helpful Customer Reviews on Amazon.com (beta)

Amazon.com: 18 reviews
7 of 8 people found the following review helpful
Solid, unique approach to algorithms 1 Aug. 2012
By C. D. Davis - Published on Amazon.com
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.
1 of 1 people found the following review helpful
Not practical, not useful, not introduction, cannot recommend it. 29 April 2015
By Cullen Clark - Published on Amazon.com
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.
1 of 1 people found the following review helpful
I like the way that this book explains stuff 16 Jan. 2015
By Recovering Engineer - Published on Amazon.com
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.
1 of 1 people found the following review helpful
Detailed, a pretty well written and thought out text 13 May 2014
By Donabed C. Kopoian - Published on Amazon.com
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.
2 of 3 people found the following review helpful
Very good book 28 Mar. 2014
By Wehbe, T. - Published on Amazon.com
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...
Were these reviews helpful? Let us know

Look for similar items by category


Feedback