Computer Algorithms: Introduction to Design and Analysis

Baase, Sara; Van Gelder, Allen

ISBN 10: 0201612445 / ISBN 13: 9780201612448

Published by Pearson, 1999

About this Item

Pages include notes, underlining, or highlighting. May have some shelf-wear due to normal use. Your purchase funds free job training and education in the greater Seattle area. Thank you for supporting Goodwills nonprofit mission! Seller Inventory # 0KVOTW003I39_ns

Bibliographic Details

Title: Computer Algorithms: Introduction to Design ...

Publisher: Pearson

Publication Date: 1999

Binding: Soft cover

Condition: Acceptable

Edition: 3rd Edition

About this title

Synopsis:

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

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