Computer Algorithms: Introduction to Design and AnalysisDrawing upon combined decades of teaching experience, Professors Sara Baase and Allen Van Gelder have extensively revised this best seller to make it the most current and accessible choice for any algorithms course. The new Third Edition features the addition of new topics and exercises and 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. |
Contents
Data Abstraction and Basic Data Structures | 69 |
Recursion and Induction | 101 |
Sorting | 149 |
Copyright | |
13 other sections not shown
Other editions - View all
Common terms and phrases
adjacency list algorithm analysis array assume asymptotic order binary search tree binary tree Boolean breadth-first search chapter color complexity computation connected component cost cycle data structure defined Definition deleted depth-first search described digraph dynamic programming edge elements entries example Exercise external node Figure function graph coloring graph G hash heap Heapsort implementation induction input insert integers IntList Java key comparisons Lemma lg(n loop lower bound match matrix multiplication median Mergesort method minimum spanning tree NP-complete number of comparisons object operations optimal output pair parameter postconditions PRAM Precondition priority queue problem processors proof Quicksort recurrence equation recursive call recursive procedure red-black tree root Section sequence shortest path solution solve sorted steps strategy string strong component subproblem subranges subroutine subset subtree Suppose Theorem topological order transitive closure undirected graph variable vertex vertices weight worst worst-case