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

This book is intended for an upper-division or graduate course in algorithms. It has sufficient material to allow several choices of topics. The purpose of the book is threefold. It is intended to teach algorithms for solving real problems that arise frequently in computer applications, to teach basic principles and techniques of computational complexity (worst-case and average behavior, space usage, and lower bounds on the complexity of a problem), and to introduce the areas of !NT-coinpleteness and parallel algorithms. Another of the book’s aims, which is at least as important as teaching the subject matter, is to develop in the reader the habit of always responding to a new algorithm with the questions: How good is it? Is there a better way? Therefore, instead of presenting a series of complete, “pulled-out-of-a-hat” algorithms with analysis, the text often discusses a problem first, considers one or more approaches to solving it (as a reader who sees the problem for the first time might), and then begins to develop an algorithm, analyzes it, and modifies or rejects it until a satisfactory result is produced. (Alternative approaches that are ultimately rejected are also considered in the exercises it is useful for the reader to know why they were rejected.)

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)

"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: emphasizes the development of algorithms through a step-by-step process rather than by 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; and includes an appendix with java examples."--Jacket Drawing upon combined decades of teaching experience, Sara Baase and Allen Van Gelder have extensively revised this best seller to make it the most current and accessible choice for anyone interested in gaining a solid understanding of computer algorithm analysis and design. This edition features the addition of new topics such as computing with DNA, the accelerated version of heapsort, and dynamic sets, as well as 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. This edition features implementations in a Java-like pseudocode, and includes an appendix with Java examples. Presenta un buen balance entre teoria y aplicacion.Los programas que operan son facilmente compilables y ejecutables. Lo actualizado de los temas y su nivel matematico lo hacen vigente en cualquier momento.Al final del libro tiene un apendice con ejemplos y tecnicas con Java. Written with the undergraduate particularly in mind, this third edition features new material on: algorithims for Java, recursion, how to prove algorithms are correct, recurrence equations, computing with DNA, and dynamic sets