logical structure
Logical structure refers to the relationship between data elements in a data object. There are the following types in detail
Set structure: elements are not directly related, they are equal to each other
Linear structure: elements have direct one-to-one correspondence
Tree structure: there is a one-to-many situation
Graph structure: many-to-many relationship (there is a directed graph and an undirected graph To distinguish, the schematic diagram of the Java GC recycling mechanism used here, the Java GC implementation is based on directed graph)
physical structure
The physical structure refers to the storage method of the logical structure of data in the computer; it is divided into linear storage and chain storage structure.
Sequential storage structure:
Chained storage structure:
Five characteristics of the algorithm
Finite Deterministic Feasibility Input Output
Algorithm Design Requirements
Correctness Readability Robustness High Efficiency Low Storage
time complexity
The time complexity of an algorithm refers to the time measurement of the algorithm, which represents the growth rate of the execution time of the algorithm as the scale of the problem expands.