Computer Algorithms: Introduction to Design and Analysis - Softcover

Baase, Sara; Van Gelder, Allen

Softcover

ISBN 10: 0201612445 ISBN 13: 9780201612448

Publisher: Pearson, 1999

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.

About this title

About the Author

Sara Baase is a Professor of Computer Science at San Diego State University, and has been teaching CS for 25 years. Dr. Baase is a three-time recipient of the San Diego State University Alumni Association's Outstanding Faculty Award, and she has written a number of textbooks in the areas of algorithms, assembly language and social and ethical issues related to computing. She earned her doctorate at the University of California, Berkeley. Allen Van Gelder is a Professor of Computer Science at the University of California at Santa Cruz, where he has been teaching CS for 12 years. He received his Ph.D. in Computer Science at Stanford University, and is a past recipient of the Presidential Young Investigator Award.

0201612445AB04062001

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

Edition details

• Publisher: Pearson
• Publication date: 1999
• ISBN 10: 0201612445
• ISBN 13: 9780201612448
• Binding: Paperback
• Language: English
• Edition number: 3
• Number of pages: 688