Introduction to the Design and Analysis of Algorithms / Edition 2

Paperback (Print)
Used and New from Other Sellers
Used and New from Other Sellers
from $13.30
Usually ships in 1-2 business days
(Save 87%)
Other sellers (Paperback)
  • All (12) from $13.30   
  • New (4) from $72.82   
  • Used (8) from $13.30   
Sort by
Page 1 of 1
Showing All
Note: Marketplace items are not eligible for any coupons and promotions
Seller since 2008

Feedback rating:



New — never opened or used in original packaging.

Like New — packaging may have been opened. A "Like New" item is suitable to give as a gift.

Very Good — may have minor signs of wear on packaging but item works perfectly and has no damage.

Good — item is in good condition but packaging may have signs of shelf wear/aging or torn packaging. All specific defects should be noted in the Comments section associated with each item.

Acceptable — item is in working order but may show signs of wear such as scratches or torn packaging. All specific defects should be noted in the Comments section associated with each item.

Used — An item that has been opened and may show signs of wear. All specific defects should be noted in the Comments section associated with each item.

Refurbished — A used item that has been renewed or updated and verified to be in proper working condition. Not necessarily completed by the original manufacturer.


Ships from: Chicago, IL

Usually ships in 1-2 business days

  • Standard, 48 States
  • Standard (AK, HI)
Seller since 2009

Feedback rating:


Condition: New
<b style='color: #000'>Brand New!</b> Ships same day or next business day. Free USPS Tracking Number. Excellent Customer Service. Ships from TN

Ships from: Nashville, TN

Usually ships in 1-2 business days

  • Standard, 48 States
  • Standard (AK, HI)
  • Express, 48 States
  • Express (AK, HI)
Seller since 2015

Feedback rating:


Condition: New
Brand new.

Ships from: acton, MA

Usually ships in 1-2 business days

  • Standard, 48 States
  • Standard (AK, HI)
Seller since 2015

Feedback rating:


Condition: New
Brand new.

Ships from: acton, MA

Usually ships in 1-2 business days

  • Standard, 48 States
  • Standard (AK, HI)
Page 1 of 1
Showing All
Sort by



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

Read More Show Less

Product Details

  • ISBN-13: 9780321358288
  • Publisher: Addison Wesley
  • Publication date: 2/17/2006
  • Edition description: REV
  • Edition number: 2
  • Pages: 592
  • Product dimensions: 7.48 (w) x 9.11 (h) x 1.14 (d)

Table of Contents




1.1 What is an Algorithm?

1.2 Fundamentals of Algorithmic Problem Solving

1.3 Important Problem Types

1.4 Fundamental Data Structures

2 Fundamentals of the Analysis of Algorithm Efficiency

2.1 Analysis Framework

2.2 Asymptotic Notations and Basic Efficiency Classes

2.3 Mathematical Analysis of Nonrecursive Algorithms

2.4 Mathematical Analysis of Recursive Algorithms

2.5 Example: Fibonacci Numbers

2.6 Empirical Analysis of Algorithms

2.7 Algorithm Visualization

3 Brute Force

3.1 Selection Sort and Bubble Sort

3.2 Sequential Search and Brute-Force String Matching

3.3 Closest-Pair and Convex-Hull Problems by Brute Force

3.4 Exhaustive Search

4 Divide-and-Conquer

4.1 Mergesort

4.2 Quicksort

4.3 Binary Search

4.4 Binary Tree Traversals and Related Properties

4.5 Multiplication of Large Integers and Strassen’s Matrix Multiplication

4.6 Closest-Pair and Convex-Hull Problems by Divide-and-Conquer

5 Decrease-and-Conquer

5.1 Insertion Sort

5.2 Depth-First Search and Breadth-First Search

5.3 Topological Sorting

5.4 Algorithms for Generating Combinatorial Objects

5.5 Decrease-by-a-Constant-Factor Algorithms

5.6 Variable-Size-Decrease Algorithms

6 Transform-and-Conquer

6.1 Presorting

6.2 Gaussian Elimination

6.3 Balanced Search Trees

6.4 Heaps and Heapsort

6.5 Horner’s Rule and Binary Exponentiation

6.6 Problem Reduction

7 Space and Time Tradeoffs

7.1 Sorting by Counting

7.2 Input Enhancement in String Matching

7.3 Hashing

7.4 B-Trees

8 Dynamic Programming

8.1 Computing a Binomial Coefficient

8.2 Warshall’s and Floyd’s Algorithms

8.3 Optimal Binary Search Trees

8.4 The Knapsack Problem and Memory Functions

9 Greedy Technique

9.1 Prim’s Algorithm

9.2 Kruskal’s Algorithm

9.3 Dijkstra’s Algorithm

9.4 Huffman Trees

10 Iterative Improvement

10.1 The Simplex Method

10.2 The Maximum-Flow Problem

10.3 Maximum Matching in Bipartite Graphs

10.4 The Stable Marriage Problem

11 Limitations of Algorithm Power

11.1 Lower-Bound Arguments

11.2 Decision Trees

11.3 P, NP, and NP-complete Problems

11.4 Challenges of Numerical Algorithms 4

12 Coping with the Limitations of Algorithm Power

12.1 Backtracking

12.2 Branch-and-Bound

12.3 Approximation Algorithms for NP-hard Problems

12.4 Algorithms for Solving Nonlinear Equations



Useful Formulas for the Analysis of Algorithms


Short Tutorial on Recurrence Relations


Hints to Exercises


Read More Show Less

Customer Reviews

Be the first to write a review
( 0 )
Rating Distribution

5 Star


4 Star


3 Star


2 Star


1 Star


Your Rating:

Your Name: Create a Pen Name or

Barnes & Review Rules

Our reader reviews allow you to share your comments on titles you liked, or didn't, with others. By submitting an online review, you are representing to Barnes & that all information contained in your review is original and accurate in all respects, and that the submission of such content by you and the posting of such content by Barnes & does not and will not violate the rights of any third party. Please follow the rules below to help ensure that your review can be posted.

Reviews by Our Customers Under the Age of 13

We highly value and respect everyone's opinion concerning the titles we offer. However, we cannot allow persons under the age of 13 to have accounts at or to post customer reviews. Please see our Terms of Use for more details.

What to exclude from your review:

Please do not write about reviews, commentary, or information posted on the product page. If you see any errors in the information on the product page, please send us an email.

Reviews should not contain any of the following:

  • - HTML tags, profanity, obscenities, vulgarities, or comments that defame anyone
  • - Time-sensitive information such as tour dates, signings, lectures, etc.
  • - Single-word reviews. Other people will read your review to discover why you liked or didn't like the title. Be descriptive.
  • - Comments focusing on the author or that may ruin the ending for others
  • - Phone numbers, addresses, URLs
  • - Pricing and availability information or alternative ordering information
  • - Advertisements or commercial solicitation


  • - By submitting a review, you grant to Barnes & and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Terms of Use.
  • - Barnes & reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & also reserves the right to remove any review at any time without notice.
  • - See Terms of Use for other conditions and disclaimers.
Search for Products You'd Like to Recommend

Recommend other products that relate to your review. Just search for them below and share!

Create a Pen Name

Your Pen Name is your unique identity on It will appear on the reviews you write and other website activities. Your Pen Name cannot be edited, changed or deleted once submitted.

Your Pen Name can be any combination of alphanumeric characters (plus - and _), and must be at least two characters long.

Continue Anonymously
Sort by: Showing 1 Customer Reviews
  • Anonymous

    Posted March 26, 2006


    Levitin is specially gifted to explain Algorithms. The way he presents the material is easier to read than other books. The book by Tardos is another very good book in terms of clarity, but this book covers more subjects. Cormen should take a class with Anany to get a clue about the right way to teach Algorithms.

    1 out of 1 people found this review helpful.

    Was this review helpful? Yes  No   Report this review
Sort by: Showing 1 Customer Reviews

If you find inappropriate content, please report it to Barnes & Noble
Why is this product inappropriate?
Comments (optional)