Introduction to the Design & Analysis of Algorithms [Hardcover]

Anany V. Levitin (Author)

Book Description

Publication Date: November 9, 2002 | ISBN-10: 0201743957 | ISBN-13: 978-0201743951 | Edition: United States ed

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.

Editorial Reviews

From the Back Cover

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.

Product Details

• Hardcover: 528 pages
• Publisher: Addison Wesley; United States ed edition (November 9, 2002)
• Language: English
• ISBN-10: 0201743957
• ISBN-13: 978-0201743951
• Product Dimensions: 9.5 x 7.5 x 1.2 inches
• Shipping Weight: 2.2 pounds
• Average Customer Review: 4.4 out of 5 stars  See all reviews (5 customer reviews)
• Amazon Best Sellers Rank: #916,075 in Books (See Top 100 in Books)

More About the Author

Discover books, learn about writers, read author blogs, and more.

Customer Reviews

Most Helpful Customer Reviews

58 of 61 people found the following review helpful:

4.0 out of 5 stars Algorithm Design from a different perspective, April 27, 2003

By 

sameer borate (Pune, India) - See all my reviews

This review is from: Introduction to the Design & Analysis of Algorithms (Hardcover)

As the author says in the preface, there are two ways of presenting algorithms. One classifies algorithms according to a problem type. The other classifies algorithms according to design techniques. A book in the first category will have separate chapters on sorting, searching, graphs etc. These books are like a toolbox. Programmers pick a particular algorithm needed for a problem, modify it if needed and obtain a solution. Most of the algorithm books fall in this category. The problem with this approach is that you have at your disposal only a finite set of algorithms to play with. What if you needed some new kind of algorithm for a specific problem. You are stuck, because most books on algorithms don't teach you how to design new algorithms or what design technique is most suited for your particular problem. It is here that Anany Levitin's book fills the gap. He teaches you the major design techiniques like Brute-Force, Divide-and-Conquer, Greedy techniques. The various algorithms like sorting, searching, graph algorithms are classified according to the various techniques. The advantage of this is that many diverse algorithms get classified according to a particular design technique. For e.g Bubble sort, Convex-Hull problem, Travelling salesman problem, Knapsack problem all fall in the Brute-Force design category. So when you are designing new algorithms you know at the start what type of problem it is and how it should be tackled.
The book teaches you algorithm design and analysis from a completely different view point. It is entertaining to read and the problems at the end of each chapter are wonderful. I only hope that the author adds nore algorithms in his next edition. Go get it!

15 of 16 people found the following review helpful:

5.0 out of 5 stars Great Introduction to Algorithmic Design, May 8, 2005

By 

William Franklin "british bill" (Detroit, MI) - See all my reviews
(REAL NAME)   

This review is from: Introduction to the Design & Analysis of Algorithms (Hardcover)

I recently finished using this book for a course. I found it to be very well written and the presentation was excellent. Most books on algorithms are hard to read and overly mathematical. This book emphasizes more the textual explanation of algorithms for practical applications and not as much on theoretical proofs etc. The exercises at the end of the chapters strongly reinforce the contents and insightful hints to every exercise are given at the end of the book. I thoroughly enjoyed using this book and found it challenging. Other books I used for reference such as the MIT classic Introduction to Algorithms was also useful but much more difficult to understand initially.

9 of 9 people found the following review helpful:

5.0 out of 5 stars A survey of algorithm techniques, October 28, 2007

By 

Timothy T. Wee "stark" (Chicago, IL USA) - See all my reviews
(REAL NAME)   

This review is from: Introduction to the Design & Analysis of Algorithms (Hardcover)

This was my textbook for my algorithms class at UW-Madison.
I like it better than Cormen's book, (introduction to algorithms) I think it's more readable and easy to follow.

A couple of caveats:
1.) This book is more of a survey. It does a deep-dive of some algorithms, but a lot of them only get a high-level description. If you are interested, you will have to look elsewhere for details, etc.

2.) The exercises are very well-written, and very interesting, some of them have been interview questions that I have encountered. The thing is, there is no answer key, and the hints section is not very useful at times.

Still, this book opened my eyes to the beauty of algorithms and math, and the elegance of solutions that are possible for "hard" problems.
After you read this book, you will have an idea of what is possible and it will give you enough ammunition, enthusiasm, and background for digging deeper.
A great collection to pair with is Sedgewick's collection on algorithms, Bundle of Algorithms in Java, Third Edition (Parts 1-5): Fundamentals, Data Structures, Sorting, Searching, and Graph Algorithms, Third Edition which may fill in some of the detail that this book may lack.