Synopsis
In this text, readers are able to look at specific problems and see how careful implementations can reduce the time constraint for large amounts of data from several years to less than a second.
This new edition contains all the enhancements of the new Java 5.0 code including detailed examples and an implementation of a large subset of the Java 5.0 Collections API.
This text is for readers who want to learn good programming and algorithm analysis skills simultaneously so that they can develop such programs with the maximum amount of efficiency. Readers should have some knowledge of intermediate programming, including topics as object-based programming and recursion, and some background in discrete math.
Booknews
This textbook for either an advanced data structures course or a first-year graduate course in algorithm analysis describes data structures--methods of organizing large amounts of data--and algorithm analysis--the estimation of the running time of algorithms. Weiss (computer science, Florida International U.) includes chapters on trees, hash tables, priority queues, sorting, the disjoint set algorithm, graph algorithms, algorithm design techniques, amortized analysis, and search tree algorithms, the k-d tree and the pairing heap. Annotation c. by Book News, Inc., Portland, Or.