Introduction to the Design and Analysis of Algorithms (2nd Edition) (Paperback)

~ Anany V. Levitin (Author)

Editorial Reviews

Product Description

Based on a 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.

From the Back Cover

Algorithms

 

Introduction to The Design & Analysis of Algorithms, 2^nd 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

Product Details

• Paperback: 592 pages
• Publisher: Addison Wesley; 2 edition (February 24, 2006)
• Language: English
• ISBN-10: 0321358287
• ISBN-13: 978-0321358288
• Product Dimensions: 9.1 x 7.5 x 1.1 inches
• Shipping Weight: 2 pounds (View shipping rates and policies)
• Average Customer Review: 4.8 out of 5 stars  See all reviews (8 customer reviews)
• Amazon.com Sales Rank: #215,382 in Books (See Bestsellers in Books)

Customer Reviews

Most Helpful Customer Reviews

49 of 52 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!

13 of 14 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.

15 of 17 people found the following review helpful:

5.0 out of 5 stars Great introductory text!, March 9, 2006

By	Karl F. Schramm "Pissed off grad student" (San Jose, CA United States) - See all my reviews (REAL NAME)

For those of you who've always wanted to throw the Cormen text out the window rejoice you finally can! This book is an excellent introduction to algorithms. Though not as thorough as the Cormen text it's orders of magnitude more readable!