Macroscopically understand the content of data structure and have an overall understanding, so that knowledge can be linked and linked into a network. The understanding of knowledge will also be more profound. The macro-level understanding is like a map to enter an unfamiliar field. With it, learning is more purposeful and the efficiency is higher.
Steps to solve the problem in the computer:
The figure below is the data structure Highlights
< br>
1. Concept
span>
Data structure is the way computers organize and store data. Data structure A group of data with one or more specific relationships between each other is organized, how they are stored in the computer, and a group of operations defined on the group of data.
2. Terminology
Macroscopically, they reflect the three levels of data organization. Data can be composed of several data elements, and data elements can be composed of several data items.
3. Composition
Data structure is a collection of data elements that have one or more specific relationships with each other, including The logical structure of the data, the storage structure of the data and the basic operations of the data
< /span>
logical structure
Set: there is no adjacency between any nodes in the set The relationship and organization are loose.
Linear structure: The nodes are arranged in a logical relationship to form a “chain”, and the nodes are adjacent to each other one by one.
Tree structure: It has branching and hierarchical characteristics, and the form is like a tree in nature. The upper node can be adjacent to multiple nodes in the lower layer, but the lower node can only be adjacent to one node in the upper layer. .
Picture structure: any two nodes can be adjacent to each other
Storage structure
1. Store data elements
2. Association between data elements
The association between data elements includes:
Sequential storage method: all storage nodes are stored in In a continuous storage area, the relative position of the node in the memory is used to represent the logical relationship between the data.
Chain storage mode: In addition to a data element, each storage node also includes a pointer, Each pointer points to a node that has a logical relationship with this node, and the pointer represents the logical relationship between data elements
Index storage method
Hash storage method
< p>
Operation
An operation imposed on a certain logical structure. Processing of logical structure. Including: create, find, read, insert and delete, etc.
< /p>
4. Algorithm
Correctness: can correctly implement the predetermined functions to meet the needs of specific problems
Readability: easy to read, understand and communicate, easy to debug, modify and expand
Robustness: Using illegal data, it can respond or deal with it appropriately, and will not produce unexpected calculation results.
Spatial-temporality: The temporal-spatiality of an algorithm refers to the time performance (time efficiency) of the algorithm —>The amount of calculation included in the algorithm
< span style="font-family:SimSun; font-size:18px"> Space performance (space efficiency) —>The amount of storage required by the algorithm
5. Summary< /span>
Data structure is a way for computers to organize and store data. A reasonable data structure can reduce the complexity of program design Degree to improve the efficiency of program execution. The main content of the data structure is the items shown in the mind map, and then the logical structure and its operation and data structure are elaborated.
The logical structure of data is implemented in a computer as a data storage structure, including the following two Parts.
An algorithm specifies the processing steps required to solve a given problem and the order of execution, so that the given The problem can be solved in a finite time.
Factors to evaluate the quality of the algorithm: