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

Baase, Sara

ISBN 10: 0201003279 / ISBN 13: 9780201003277

Published by Addison Wesley Publishing Compan, 1978

About this Item

Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority! Seller Inventory # S_366834748

Bibliographic Details

Title: Computer Algorithms: Introduction to Design ...

Publisher: Addison Wesley Publishing Compan

Publication Date: 1978

Binding: textbook

Condition: Good

About this title

Synopsis:

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

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