did-you-know? rent-now

Amazon no longer offers textbook rentals. We do!

did-you-know? rent-now

Amazon no longer offers textbook rentals. We do!

We're the #1 textbook rental company. Let us show you why.

9780201743951

Introduction to the Design and Analysis of Algorithms

by
  • ISBN13:

    9780201743951

  • ISBN10:

    0201743957

  • Format: Hardcover
  • Copyright: 2003-01-01
  • Publisher: Addison Wesley
  • View Upgraded Edition

Note: Supplemental materials are not guaranteed with Rental or Used book purchases.

Purchase Benefits

  • Free Shipping Icon Free Shipping On Orders Over $35!
    Your order must be $35 or more to qualify for free economy shipping. Bulk sales, PO's, Marketplace items, eBooks and apparel do not qualify for this offer.
  • eCampus.com Logo Get Rewarded for Ordering Your Textbooks! Enroll Now
List Price: $106.60 Save up to $26.65
  • Buy Used
    $79.95
    Add to Cart Free Shipping Icon Free Shipping

    USUALLY SHIPS IN 2-4 BUSINESS DAYS

Supplemental Materials

What is included with this book?

Summary

Based on a new classification of algorithm design techniques and a clear delineation of analysis methods,Introduction to the Design and Analysis of Algorithmspresents 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.

Author Biography

Anany Levitin is Professor of Computing Sciences at Villanova University

Table of Contents

Preface xix
Introduction
1(40)
Fundamentals of the Analysis of Algorithm Efficiency
41(56)
Brute Force
97(24)
Divide-and-Conquer
121(34)
Decrease-and-Conquer
155(38)
Transform-and-Conquer
193(52)
Space and Time Tradeoffs
245(30)
Dynamic Programming
275(28)
Greedy Technique
303(28)
Limitations of Algorithm Power
331(36)
Coping with the Limitations of Algorithm Power
367(42)
Epilogue 409(4)
Appendix A Useful Formulas for the Analysis of Algorithms 413(4)
Appendix B Short Tutorial on Recurrence Relations 417(14)
Bibliography 431(8)
Hints to Exercises 439(40)
Index 479

Supplemental Materials

What is included with this book?

The New copy of this book will include any supplemental materials advertised. Please check the title of the book to determine if it should include any access cards, study guides, lab manuals, CDs, etc.

The Used, Rental and eBook copies of this book are not guaranteed to include any supplemental materials. Typically, only the book itself is included. This is true even if the title states it includes any access cards, study guides, lab manuals, CDs, etc.

Rewards Program