Description
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.
Read More
Data Structures and Algorithm Analysis in Java is an “advanced algorithms” book that fits between traditional CS2 and Algorithms Analysis courses. In the old ACM Curriculum Guidelines, this course was known as CS7. 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.As the speed and power of computers increases, so does the need for effective programming and algorithm analysis. By approaching these skills in tandem, Mark Allen Weiss teaches readers to develop well-constructed, maximally efficient programs in Java.Weiss clearly explains topics from binary heaps to sorting toNP-completeness, and dedicates a full chapter to amortized analysis and advanced data structures and their implementation. Figures and examples illustrating successive stages of algorithms contribute to Weiss’ careful, rigorous and in-depth analysis of each type of algorithm. A logical organization of topics and full access to source code complement the text’s coverage.
Read Less