Introduction to Design and Analysis of Algorithms

by Ashok Namdev Kamthane

Description valued by students and trusted by instructors, introductionto the design and analysis of algorithms employs a comprehensivetaxonomy of algorithm-design techniques that is more powerful andintuitive than the traditional approach. This book provides a coherent and pedagogically soundframework for learning and teaching algorithms. An extensive anddetailed solutions manual is available online for the benefit ofstudents and instructors. Student learning is further supported byexercise hints and chapter summaries. Popular puzzles and gamesprovide motivation for students, and rhetorical questioning servesas an effective learning device. Ideal for a basic course in thedesign and analysis of algorithms, this second edition features 80new puzzles and exercises. Employs an innovative and more comprehensive taxonomy of algorithm design techniques. Covers mathematical analysis of both nonrecursive and recursive algorithms, as well as empirical analysis and algorithm visualization. Discusses limitations of algorithms and ways to overcome them. Treats algorithms as problem-solving tools and develops algorithmic thinking by using puzzles and games. Contains over 600 exercises with hints for students and detailed solutions for instructors. New chapter! iterative improvement the simplex method, maximum network flows, maximum matching in bipartite graphs, and the stable marriage problem. New! revised section on approximation algorithms for tsp.

512 pages, Unknown Binding