Computer Algorithms: Introduction to Design and Analysis (3rd Edition)

Baase, Sara, Van Gelder, Allen

ISBN 10: 0201612445 / ISBN 13: 9780201612448

Published by Pearson, 1999

Item in good condition and has highlighting/writing on text. Used texts may not contain supplemental items such as CDs, info-trac etc. Seller Inventory # 00079879429

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

Bibliographic Details

Title: Computer Algorithms: Introduction to Design ...
Publisher: Pearson
Publication Date: 1999
Binding: Soft cover
Condition: Good
Edition: 3rd Edition