Data Structures and Algorithm Analysis -- Java Language Description

Author: Mark Allen Weiss
Publisher:
Publication Date: Not available
Features: The main features of this book are:
· Contains rich sample programs written in Java, which can be obtained from the Internet.
· Dedicated a chapter to discuss algorithm design techniques, including greedy algorithms, divide-and-conquer algorithms, dynamic programming algorithms, randomized algorithms, and backtracking algorithms.
· Explores current popular topics and new data structures, such as Fibonacci heaps, skew heaps, binomial queues, skip lists, and splay trees.
· Dedicated a chapter to discuss amortized analysis and further examine the performance of some advanced data structures described in the book.
· Arranges a chapter to discuss advanced data structures and their implementations, including red-black trees, top-down splay trees, pairing heaps, etc.
· Proposes some unsolved and partially unsolved problems.
· Includes two appendices at the end of the book about the Java language. Appendix A introduces basic Java classes, while Appendix B discusses the Collections framework, introducing many Java programs closely related to the data structures and algorithms in this book.
This book is a standard textbook for data structures and algorithm analysis in foreign countries, using the excellent Java programming language as the implementation tool to discuss data structures and algorithm analysis. The book emphasizes the concept of abstract data types and provides a comprehensive analysis of the efficiency, performance, and runtime of algorithms, laying a foundation for readers to develop high-efficiency programs. This book can be used as a textbook for advanced data structures courses or for algorithm analysis courses for undergraduate and graduate students in universities.