Data Structures + Algorithms

Author: Xia Kejian
Publisher:
Publish Date: 2001-02-01
Features: The renowned Swiss computer scientist N. Wirth proposed the formula: Data Structure + Algorithm = Program. Here, data structure refers to the representation of data and their relationships, including both logical and storage structures. Essentially, it studies how mathematical models abstracted from specific problems are represented in computer memory. Algorithm, on the other hand, is the method for processing data, exploring how operations can be applied to corresponding data structures to accomplish the desired tasks. If both the data representation and data processing for a problem are implemented, it means the corresponding programming task is completed. This book systematically introduces common data structure types, focusing on how data structures are represented in computer memory and how related algorithms can be implemented on data storage structures, while also providing necessary analysis of algorithmic time complexity. The book consists of ten chapters: Chapter 1 Introduction, introducing basic concepts around data structures and algorithms; Chapters 2 to 4 discuss linear structures—linear lists, stacks and queues, strings, etc.; Chapter 5 discusses arrays and general lists, which can be seen as extensions of linear lists; Chapter 6 discusses hierarchical structures—trees, with a focus on binary tree structures and related algorithms; Chapter 7 discusses network structures—graphs, emphasizing graph storage structures and basic algorithms; Chapters 8 and 9 discuss search and sorting methods in data processing, with the key being to improve algorithmic execution speed; Chapter 10 introduces the basic concepts and structures of files. Additionally, many chapters in the book provide practical examples of data structure applications.