Computer Algorithms: Introduction to Design and Analysisthe 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. |
Contents
Sorting | 47 |
Selection and Adversary Arguments | 123 |
Graphs and Digraphs | 145 |
Copyright | |
8 other sections not shown
Other editions - View all
Common terms and phrases
adjacency list adversary array assigned assume average bicomponent biconnected binary search Boolean buckets C-Find candidate edge complexity compute connected component consider data structure decision problems decision tree depth-first search described digraph dynamic programming end{for entries example Exercise Figure function graph coloring graph G graph or digraph heap Heapsort implementation input Insertion Sort integer key comparisons Lemma linked list loop lower bound match matrix multiplication median merge Mergesort minimum spanning tree Niff node NP-complete number of comparisons number of keys number of operations number of steps O(nlgn optimal output parallel pointer polynomial PRAM processors Proof Quicksort recursive rithm root run construction Section sequence shortest path solution solve sorting algorithms strategy string strong component sublists subset subset sum problem subtree Suppose tape Theorem tion total number transitive closure traversed Union-Find unions vertices weighted graph worst worst-case write