Books.org participates in affiliate programs including Bookshop.org and the Amazon Services LLC Associates Program. We may earn a commission from qualifying purchases made through links on this page, at no additional cost to you.
Overview
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
Synopsis
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
Booknews
This college textbook introduces algorithms for solving real problems that arise frequently in computer applications, basic principles of computational complexity, and -completeness and parallel algorithms. The third edition adds chapters on abstract data types, recursion and induction, and dynamic sets and searching. Annotation c. Book News, Inc., Portland, OR (booknews.com)