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.
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)