- STAFF PICKS
- GIFTS + GIFT CARDS
- SELL BOOKS
- FIND A STORE
Used Trade Paper
Ships in 1 to 3 days
available for shipping or prepaid pickup only
Available for In-store Pickup
in 7 to 12 days
Introduction To the Design and Analysis of Algorithms (3RD 12 Edition)by Anany Levitin
Synopses & ReviewsPlease note that used books may not include additional media (study guides, CDs, DVDs, solutions manuals, etc.) as described in the publisher comments.
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.
Table of Contents
New to the Third Edition xvii
1 Introduction 1
2 Fundamentals of the Analysis of Algorithm Efficiency 41
3 Brute Force and Exhaustive Search 97
4 Decrease-and-Conquer 131
5 Divide-and-Conquer 169
6 Transform-and-Conquer 201
7 Space and Time Trade-offs 253
8 Dynamic Programming 283
9 Greedy Technique 315
10 Iterative Improvement 345
11 Limitations of Algorithm Power 387
12 Coping with the Limitations of Algorithm Power 423
Useful Formulas for the Analysis of Algorithms 475
Short Tutorial on Recurrence Relations 479
Hints to Exercises 503
What Our Readers Are Saying