Data Structures (Liu Da You)

Author: Liu Da
Publisher:
Publish Date: 2004-04-01
Features: This book introduces the concepts and content of data structures, mainly including five parts: Introduction, Basic Data Structures, Typical Algorithms, Advanced Data Structures, and Applications. Among them, the Introduction part serves as the prerequisite knowledge for the book, providing a brief overview of ADL language, data structures and algorithms, fundamentals of algorithm analysis, OOP, and C++. The Basic Data Structures part includes linear lists, stacks and queues, arrays, strings, integer sets, trees, and graphs. The Typical Algorithms part mainly introduces the implementation of several typical algorithms, along with necessary complexity analysis and comparison processes, specifically including recursion, sorting, searching, and memory management. The Advanced Data Structures part mainly includes priority queues, disjoint set classes, and file structures. The Applications part presents some application examples of the aforementioned data structures and typical algorithms, including event-driven simulation, online equivalence classes, incomplete chessboards, and image compression. It can be used as a textbook for computer science majors in universities and colleges, or as a reference for professional technicians.
Introduction: This book introduces the concepts and content of data structures, mainly including five parts: Introduction, Basic Data Structures, Typical Algorithms, Advanced Data Structures, and Applications. Among them, the Introduction part serves as the prerequisite knowledge for the book, providing a brief overview of ADL language, data structures and algorithms, fundamentals of algorithm analysis, OOP, and C++. The Basic Data Structures part includes linear lists, stacks and queues, arrays, strings, integer sets, trees, and graphs. The Typical Algorithms part mainly introduces the implementation of several typical algorithms, along with necessary complexity analysis and comparison processes, specifically including recursion, sorting, searching, and memory management. The Advanced Data Structures part mainly includes priority queues, disjoint set classes, and file structures. The Applications part presents some application examples of the aforementioned data structures and typical algorithms, including event-driven simulation, online equivalence classes, incomplete chessboards, and image compression. It can be used as a textbook for computer science majors in universities and colleges, or as a reference for professional technicians.