Computer Algorithms: Introduction to Design and Analysis
the design and analysis of algorithms, including an exhaustive array of algorithms and their complexity analyses. Baase emphasizes the development of algorithms through a step-by-step process, rather than merely presenting the end result. Three chapters on modern topics are new to this edition: adversary arguments and selection, dynamic programming, and parallel algorithms.
What people are saying - Write a review
We haven't found any reviews in the usual places.
Selection and Adversary Arguments
Graphs and Digraphs
8 other sections not shown
Other editions - View all
adjacency list adversary analysis array assigned assume average bicomponent biconnected binary search Boolean buckets candidate edge chapter complexity compute connected component consider data structure decision problems decision tree depth-first search described digraph dynamic programming entries example Exercise Figure function graph coloring graph G graph or digraph heap Heapsort implementation input Insertion Sort instructions integer key comparisons Lemma linked list loop lower bound match matrix multiplication median merge Mergesort minimum spanning tree Niff node number of comparisons number of keys number of operations number of steps optimal output parallel parisons pointer polynomial PRAM processors Proof Quicksort recursive rithm root run construction Section sequence shortest path solution solve sorting algorithms splitPoint strategy string strong component sublists subset subset sum problem subtree Suppose tape Theorem tion total number transitive closure traversed Union-Find unions VertexType vertices VP-complete weighted graph worst worst-case write