Introduction to the Design and Analysis of Algorithms (2nd Editio

Levitin, Anany

ISBN 10: 0321358287 / ISBN 13: 9780321358288

Editore: Addison Wesley, 2006

Riguardo questo articolo

Very Good Condition. Five star seller - Buy with confidence!

Codice articolo X0321358287X2

Dati bibliografici

• Titolo: Introduction to the Design and Analysis of Algorithms (2nd Editio
• Editore: Addison Wesley
• Data di pubblicazione: 2006
• Lingua: Inglese
• ISBN 10: 0321358287
• ISBN 13: 9780321358288
• Rilegatura: Brossura
• Edizione: seconda edizione
• Condizione: Very Good

Descrizione articolo

Riassunto

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

Dalla quarta di copertina

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