Introduction to the Design and Analysis of Algorithms

Anany Levitin

ISBN 10: 0321364139 / ISBN 13: 9780321364135

Published by Addison Wesley, 2006

About this Item

Zustand: Gut | Seiten: 562 | Sprache: Englisch | Produktart: Bücher | Keine Beschreibung verfügbar.

Seller Inventory # 3258804/203

Bibliographic Details

• Title: Introduction to the Design and Analysis of Algorithms
• Publisher: Addison Wesley
• Publication Date: 2006
• Language: English
• ISBN 10: 0321364139
• ISBN 13: 9780321364135
• Binding: Soft cover
• Edition: 2nd Edition
• Condition: Gut
• Seller catalogs:
  • Bücher

About this title

Synopsis

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, 2nd 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