BN.com Gift Guide

Introduction to the Design and Analysis of Algorithms / Edition 1

Hardcover (Print)
Used and New from Other Sellers
Used and New from Other Sellers
from $1.99
Usually ships in 1-2 business days
(Save 98%)
Other sellers (Hardcover)
  • All (13) from $1.99   
  • New (3) from $50.56   
  • Used (10) from $1.99   
Close
Sort by
Page 1 of 1
Showing All
Note: Marketplace items are not eligible for any BN.com coupons and promotions
$50.56
Seller since 2014

Feedback rating:

(320)

Condition:

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.

New
Brand New Item.

Ships from: Chatham, NJ

Usually ships in 1-2 business days

  • Canadian
  • International
  • Standard, 48 States
  • Standard (AK, HI)
  • Express, 48 States
  • Express (AK, HI)
$69.74
Seller since 2007

Feedback rating:

(129)

Condition: New
Hardcover New 0201743957 New book with very minor shelf wear. Never used. Nice gift. Best buy. Shipped promptly and packaged carefully.

Ships from: Woodinville, WA

Usually ships in 1-2 business days

  • Canadian
  • International
  • Standard, 48 States
  • Standard (AK, HI)
  • Express, 48 States
  • Express (AK, HI)
$69.99
Seller since 2014

Feedback rating:

(78)

Condition: New
0201743957 Special holiday sale! Only 1 copy left. Clean, unmarked copy. In excellent shape! I can send expedited rate if you chose; otherwise it will promptly be sent via media ... rate. Got any questions? Email me; I'm happy to help! During the holiday season, we recommend selecting Expedited Shipping to get your book as fast as possible. Read more Show Less

Ships from: Los Angeles, CA

Usually ships in 1-2 business days

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

Overview

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 truly innovative manner. Written in a reader-friendly style, the book encourages broad problem-solving skills while thoroughly covering the material required for introductory algorithms. The author emphasizes conceptual understanding before the introduction of the formal treatment of each technique. Popular puzzles are used to motivate readers' interest and strengthen their skills in algorithmic problem solving. Other enhancement features include chapter summaries, hints to the exercises, and a solution manual. For those interested in learning more about algorithms.

Read More Show Less

Product Details

  • ISBN-13: 9780201743951
  • Publisher: Addison Wesley
  • Publication date: 10/30/2002
  • Edition description: Older Edition
  • Edition number: 1
  • Pages: 528
  • Product dimensions: 7.30 (w) x 9.20 (h) x 1.20 (d)

Table of Contents

(Each chapter ends with a “Summary”.)

Preface.


1. Introduction.

The notion of algorithm.

Fundamentals of algorithmic problem solving.

Important problem types.

Fundamental data structures.

2. Fundamentals of the Analysis of Algorithm Efficiency.

Analysis framework.

Asymptotic notations and standard efficiency classes.

Mathematical analysis of nonrecursive algorithms.

Mathematical analysis of recursive algorithms.

Example: Fibonacci numbers.

Empirical analysis of algorithms.

Algorithm visualization.

3. Brute Force.

Selection sort and bubble sort.

Sequential search and brute-force string matching.

The closest-pair and convex-hull problems by brute force.

Exhaustive search.

4. Divide-and-Conquer.

Mergesort.

Quicksort.

Binary search.

Binary tree traversals and related properties.

Multiplication of large integers and Strassen's matrix multiplication.

Closest-pair and convex-hull problems by divide-and-conquer.

5. Decrease-and-Conquer.

Insertion sort.

Depth-first search and breadth-first search.

Topological sorting.

Algorithms for generating combinatorial objects.

Decrease-by-a-constant-factor algorithms.

Variable-size-decrease algorithms.

6. Transform-and-conquer.

Presorting.

Gaussian elimination.

Balanced search trees.

Heaps and heapsort.

Horner's rule and binaryexponentiation.

Problem reduction.

7. Space and Time Tradeoffs.

Sorting by counting.

Horspool's and Boyer-Moore algorithms for string matching.

Hashing.

B-trees.

8. Dynamic Programming.

Computing a binomial coefficient.

Shortest-path problems.

Warshall's and Floyd's algorithms.

Optimal binary search trees.

The knapsack problem and memory functions.

9. Greedy Technique.

Prim's algorithm.

Kruskal's algorithm.

Dijkstra's algorithm.

Huffman trees.

10. Limitations of Algorithm Power.

Lower-bound arguments.

Decision trees.

P, NP, and NP-complete problems.

Challenges of numerical algorithms.

11. Coping with the Limitations of Algorithm Power.

Backtracking.

Branch-and-bound.

Approximation algorithms for NP-hard problems.

Algorithms for solving nonlinear equations.

Epilogue.


Appendix A: Useful Formulas for the Analysis of Algorithms.


Appendix B: Short Tutorial on Recurrence Relations.


Bibliography.


Hints to Exercises.


Index.

Read More Show Less

Customer Reviews

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

5 Star

(0)

4 Star

(0)

3 Star

(0)

2 Star

(0)

1 Star

(0)

Your Rating:

Your Name: Create a Pen Name or

Barnes & Noble.com 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 & Noble.com 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 & Noble.com 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 BN.com 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

Reminder:

  • - By submitting a review, you grant to Barnes & Noble.com and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Noble.com Terms of Use.
  • - Barnes & Noble.com reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & Noble.com 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 BN.com. 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 all of 2 Customer Reviews
  • Anonymous

    Posted June 4, 2003

    An interestingly different approach

    The definitive books on algorithms are widely acknowledged to be those by Donald Knuth, 'The Art of Computer Programming'. Very detailed, and with voluminous problem sets, they have been the standard for decades. Along comes this book with its claim of a different and complementary classification of the field. The traditional way is, from a top-down vantage, that at the highest level, you descend from the root to the various main problem types. Beneath each problem node would be subclassifications based on the techniques used to attack that problem. (I could say 'solve', but that is certainly not the case for some problems.) This is the most natural classification, because you often get a problem put in front of you, and you start from there. Problem-driven. But what if a method to attack problem A and a method to attack problem B were very similar? Is there a way to combine these method nodes? In the problem-driven tree, not really. So what the author suggests is a method-driven tree, where problems are descendents of a method. You regard solutions or research into problems as instantiations of a particular method. Sound familiar? You can draw analogies with physics, if you map the methods into the laws of physics. We should not follow this too literally. But seen from this vantage, the author's idea is very reasonable. In physics, the solutions to a problem are (ideally, anyway) derived ultimately from the laws of physics. We should not draw a contrast between the author's suggestions and the prevailing approach too sharply. At the research level, a competent analyst should be aware of different problem areas from which solutions could be drawn, or to which a solution might be adapted. As a practical matter, it comes down to the difference in emphasis for most, rather than a different worldview. Nonetheless, this is potentially quite a gem for a researcher. The author's different emphasis may be the trigger to solving one of your problems.

    Was this review helpful? Yes  No   Report this review
  • Anonymous

    Posted November 9, 2009

    No text was provided for this review.

Sort by: Showing all of 2 Customer Reviews

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