General Information  
Author(s)DE MICHEL
PublisherMcGraw Hill
Publish YearJanuary 2003


This text explains the fundamentals of algorithms in a story line that makes the material enjoyable and easy to digest. Emphasis is placed on understanding the crisp mathematical idea behind each algorithm, in a manner that is intuitive and rigorous without being unduly formal. An alternative to the comprehensive algorithm texts in the market, Dasgupta strength is that the math follows the algorithms. In addition to the text, DasGupta also offers a Solutions Manual, which is available on the Online Learning Center. Key features MESSAGE: An alternative to comprehensive algorithm texts Self contained chapters that provide a variety of perspectives on the implementation of algorithms-- The authors cover THE essential algorithms that students need to know, and math follows the algorithm, which makes this text unique. The book is concise and realistic; with key Design Issues and rationales that clearly outline the problems to be solveD and show how to develop the algorithm. This is a highly flexible text with self contained chapters: some simple and others high level; that provide a variety of perspectives on the analysis and design of algorithms. Carefully class tested at UCSD and UC Berkeley OVER 10 YEARS. The book uses a unique approach for proofs and is intuitive and accessible. SPRINKLED WITH interesting stories about the development of important algorithms AS WELL AS ABOUT THEIR CURRENT USES IN THE GLOBAL INFORMATION ENVIRONMENT.