In the design of many types of programs, the choice of data structures is a fundamental design consideration. The construction experience of many large-scale systems shows that the difficulty of system implementation and the quality of system construction are seriously dependent on whether the optimal data structure is selected.
Many times, after the data structure is determined, the algorithm is easy to obtain. Sometimes things go the other way, and we choose a data structure to fit a specific algorithm. In either case, choosing the appropriate data structure is very important.
After selecting the data structure, the algorithm is also determined. Data, not algorithms, is the key factor in system construction. This insight has led to the emergence of many software design methods and programming languages, and object-oriented programming languages ??are one of them.
Extended information:
Data structure classification:
1. Set structure. The relationship between the data elements of this structure is "belonging to the same set".
2. Linear structure. There is a one-to-one relationship between the data elements of this structure.
3. Tree structure. There is a one-to-many relationship between the data elements of this structure.
4. Graphic structure. There is a many-to-many relationship between the data elements of this structure, also called a network structure. A data structure has two elements. One is a collection of data elements and the other is a collection of relationships. Formally, a data structure can usually be represented by a tuple.
Baidu Encyclopedia-Data Structure