Computer Algorithms: Introduction to Design and Analysis (Addison-Wesley Series in Computer Science)

Sara Baase

ISBN 10: 0201060353 / ISBN 13: 9780201060355

Published by Addison-Wesley, 1988

About this Item

[ No Hassle 30 Day Returns ][ Ships Daily ] [ Underlining/Highlighting: NONE ] [ Writing: NONE ] [ Edition: Second ] Publisher: Addison-Wesley Pub Date: 2/1/1988 Binding: Hardcover Pages: 600 Second edition.

Seller Inventory # 6584927

Bibliographic Details

• Title: Computer Algorithms: Introduction to Design and Analysis (Addison-Wesley Series in Computer Science)
• Publisher: Addison-Wesley
• Publication Date: 1988
• Language: English
• ISBN 10: 0201060353
• ISBN 13: 9780201060355
• Binding: Hardcover
• Edition: 2nd Edition
• Condition: Very Good

About this title

Synopsis

This second edition offers an unusually thorough and readable look at the design and analysis of algorithms, including an exhaustive array of algorithms and their complexity analyses.Baase emphasizes the development of algorithms through a step-by-step process, rather than merely presenting the end result. Three chapters on modern topics are new to this edition: adversary arguments and selection, dynamic programming, and parallel algorithms. 0201060353B04062001

From the Back Cover

Drawing upon combined decades of teaching experience, Professors Sara Baase and Allen Van Gelder have extensively revised this best seller on algorithm design and analysis to make it the most current and accessible book available. This edition features an increased emphasis on algorithm design techniques such as divide-and-conquer and greedy algorithms, along with the addition of new topics and exercises. It continues the tradition of solid mathematical analysis and clear writing style that made it so popular in previous editions.

Highlights

• Emphasizes the development of algorithms through a step-by-step process rather than merely presenting the end result
• Stresses the importance of the algorithm analysis process—continuously re-evaluating, modifying, and perhaps rejecting algorithms until a satisfactory solution is attained
• Provides extensive treatment of recursion with a clear, student-friendly review of how it works and why it is a valuable programming technique
• Uses a Java-like pseudocode; includes an appendix with Java examples

0201612445B04062001