Computer Algorithms: Introduction To Design And Analysis

0.0

Drawing upon combined decades experience, Professors Sara Baasse 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 this book so popular in previous editions. 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 pseudo code; includes an appendix with Java examples Table of Contents Analyzing Algorithms and Problems: Principles and Examples Data Abstraction and Basic Data Structures Recursion and Induction Sorting Selection and Adversary Arguments Dynamic Sets and Searching Graphs and Graph Traversals Graph Optimization Problems and Greedy Algorithms Transitive Closure, All-Pairs Shortest Paths Dynamic Programming String Matching Polynomials and Matrices NP-Complete Problems Parallel Algorithms Java Examples and Techniques