Buy used: $72.36

FREE delivery Saturday, February 17. Order within 20 hrs 38 mins

Select delivery location

Used: Good | Details

Sold by eCampus_

Fulfilled by Amazon

Access codes and supplements are not guaranteed with used items.

Follow the author

Anany Levitin

Follow

Introduction to the Design and Analysis of Algorithms 3rd Edition

by Anany Levitin (Author)

3.9 207 ratings

See all formats and editions

Based on a new classification of algorithm design techniques and a clear delineation of analysis methods, Introduction to the Design and Analysis of Algorithms presents the subject in a coherent and innovative manner. Written in a student-friendly style, the book emphasizes the understanding of ideas over excessively formal treatment while thoroughly covering the material required in an introductory algorithms course. Popular puzzles are used to motivate students' interest and strengthen their skills in algorithmic problem solving. Other learning-enhancement features include chapter summaries, hints to the exercises, and a detailed solution manual.

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.

ISBN-10

0132316811
ISBN-13

978-0132316811
Edition

3rd
Publisher

Pearson
Publication date

September 29, 2011
Language

English
Dimensions

7.3 x 1.17 x 9 inches
Print length

600 pages
See all details

Thomas H. Cormen
501
Hardcover
in Computer Algorithms
85 offers from $75.78
Anany Levitin
26
Paperback
23 offers from $11.38
Levitin
2
Paperback
3 offers from $50.92
Steven S S. Skiena
572
Paperback
24 offers from $22.53
Jon Kleinberg
387
Paperback
37 offers from $26.68
Michael Scott
85
Paperback
45 offers from $28.25

Product details

Publisher ‏ : ‎ Pearson; 3rd edition (September 29, 2011)
Language ‏ : ‎ English
Paperback ‏ : ‎ 600 pages
ISBN-10 ‏ : ‎ 0132316811
ISBN-13 ‏ : ‎ 978-0132316811
Item Weight ‏ : ‎ 1.65 pounds
Dimensions ‏ : ‎ 7.3 x 1.17 x 9 inches

Best Sellers Rank: #814,042 in Books (See Top 100 in Books)
- #101 in Computer Simulation (Books)
- #257 in Programming Algorithms
- #4,719 in Core

Customer Reviews:
3.9 207 ratings

Brief content visible, double tap to read full content.

Full content visible, double tap to read brief content.

Videos

Help others learn more about this product by uploading a video!

Upload your video

Important information

To report an issue with this product or seller, click here.

About the author

Follow authors to get new release updates, plus improved recommendations.

Anany Levitin

Brief content visible, double tap to read full content.

Full content visible, double tap to read brief content.

Discover more of the author’s books, see similar authors, read author blogs and more

Customer reviews

3.9 out of 5

207 global ratings

How customer reviews and ratings work

Reviews with images

See all photos

Sort reviews by

Top reviews from the United States

There was a problem filtering reviews right now. Please try again later.

Wehbe, T.

Very good book

Reviewed in the United States on March 28, 2014

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...

4 people found this helpful

Helpful

C. D. Davis

Solid, unique approach to algorithms

Reviewed in the United States on August 1, 2012

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.

13 people found this helpful

Helpful

Morgan C.

Great Book!

Reviewed in the United States on December 21, 2015

Verified Purchase

I really liked how short the chapters/sections were. It was easy to understand. Not as complicated as I thought. I finished the class that required this book, but I'll be keeping it as a reference.

3 people found this helpful

Helpful

Buddy White

Not enough examples

Reviewed in the United States on April 3, 2019

Verified Purchase

Wow, who actually reads these for textbooks. Anyway as a student who has read this entire book I have to say it was one of the worst. The book leaves out pseudo code for a good portion of the code they discuss. It also is severely lacking in examples, usually only having one for each concept. And each step of the example isn't even described! The author is also super obnoxious (I know i'm petty). They say things like "Obviously..." or "Clearly..." or "The solution should be clear..." UGH! Anyway as a professor I'm sure this book looks great but as a student. Not. A. Fan.

15 people found this helpful

Helpful

Donabed C. Kopoian

Detailed, a pretty well written and thought out text

Reviewed in the United States on May 13, 2014

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 people found this helpful

Helpful

John Gable

Good for algorithms, nothing else

Reviewed in the United States on February 18, 2020

Verified Purchase

The book is very good at breaking down the algorithms into pseudo code, and providing simplistic explanations. However, if your professor is anything like mine and assigns the chapter examples as homework you're screwed. The examples don't follow the actual chapter content very well, and are VERY math intensive. The chapters do not provide any mathematical steps to analyzing your algorithms which is all the chapter examples are about early on... Also, the solution guide is very nonsensical, and frequently will drop numbers in and out leaving you puzzled if you aren't able to read between the steps being done.

Overall, book is good for algorithms, but allows lacking professors to assign problems that even they can't explain when asked to...

Helpful

Amazon Customer

ok, with one fatal flaw

Reviewed in the United States on February 21, 2012

Verified Purchase

This was the required textbook for my Design and Analysis of Algorithms class. The text content is decent and clearly written, but there are no answers to the heavily math-oriented (that's the nature of this topic) exercises in the back of this book -instead the author thinks that an annoying series of hints will provide the necessary help with the exercises.

As anyone who has done any schoolwork involving math will know, feedback in the form of answers to exercises is critical to knowing whether or not you're on the right track with learning the material. The publisher website has the solutions -available only to instructors (presumably) behind a pay wall, which is about as useful to me as a steering wheel on a sliding-glass door. And for a $90 book, I really don't think I should have to petition an instructor to get answers for me so that I can check my work.

IMHO, the author would have wasted less time by simply putting odd answers in and skipping the hint BS. Now I've gotta drop another wad of cash on a supplemental book (I'm going to try Introduction to Algorithms since it has answers available online at least) so that I'm not flying blind or stuck receiving feedback after the fact in the form of a grade that may suffer for the lack of answers to compare my work to.

27 people found this helpful

Helpful

Mahamed Omran

A great textbook

Reviewed in the United States on September 21, 2016

Verified Purchase

Levitin’s textbook is great. It is concise and precise. The explanation is generally very clear and the organization of the topic is top notch. I fully recommend it. I have to say, however, that sometimes the explanation is too brief (few examples). In that case, I usually consult another excellent and easy-to-read textbook titled “Foundations of Algorithms” by R. Neapolitan. The latter has more examples but organisation-wise I prefer Levitn’s.

4 people found this helpful

Helpful

Top reviews from other countries

Translate all reviews to English

Kibranoz

DO NOT PURCHASE Missing content in the electronic edition

Reviewed in Canada on February 24, 2023

Verified Purchase

Content is missing from the book, there seems to be a formatting issue. This book has a lot of mathematical demonstration but some of these symbols are missing, and sometimes exponents are just completely out of place. Total waste of money considering I needed this book to understand some concepts I really needed for an assigment next sunday.

Hiram E. Pérez

Detalles en portada.

Reviewed in Mexico on July 5, 2021

Verified Purchase

La pasta es blanda y supongo que por eso llegó con raspones y detalles en las esquinas. Por lo demás, todo bien.

Translate review to English

shailu yadav

Price too much

Reviewed in India on December 3, 2019

Verified Purchase

Front cover different and too much price.

Marios Sofokleous

Four Stars

Reviewed in the United Kingdom on January 11, 2016

Verified Purchase

Nice book but no solutions

Thomas Letschert

Solide und unterhaltsam

Reviewed in Germany on January 14, 2013

Verified Purchase

Levitin gibt einen sehr kurzen Abriss zur Datenstrukturen und bespricht dann in einem Kapitel die Analyse der Effizienz von Algorithmen. Ein Abschnitt ist der P, NP-Thematik gewidmet. Der Rest, und damit die Masse des Buchs, beschreibt den Entwurf von Algorithmen mit diversen Methoden (Brute Force, Divide and Conquer etc.) in vielen ausführlich und gut verständlich erläuterten Beispielen. Der Stil ist unterhaltsam und das Lesen ist (zumindest mir) ein großer Spaß (gewesen).

Erwarten Sie also kein Sammelsurium mit Erklärungen dazu, wie Datenstrukturen in Programmiersprache X implementiert werden (dazu gibt es genug andere - teils lausige - Bücher), oder wie in in Programmiersprache Y Algorithmen umgesetzt werden (auch dazu ..). Erwarten Sie das was der Titel verspricht. Sie werden es bekommen.

Eine kleine Warnung: Zu den vielen Übungen gibt es Lösungshinweise, die tatsächlich nur teils vage Hinweise sind und damit jeder Versuchung vorbeugen, das Nach-Denken für einen vollwertigen Ersatz des Nachdenkens zu halten.

One person found this helpful

Translate review to English

See more reviews

Image Unavailable

Follow the author

Introduction to the Design and Analysis of Algorithms 3rd Edition

About the Author

Customers who viewed this item also viewed

Product details

Videos

Important information

About the author

Anany Levitin

Customer reviews

Reviews with images

Top reviews from the United States

There was a problem filtering reviews right now. Please try again later.

Top reviews from other countries