Data structure review notes-Chapter 1

1. What is data structure)

A Data Structure is a set of data elements with one or more specific relationships. It is a mathematical abstraction of objects to be operated on.

2. Relationships between common data elements

Set: data elements in a set have no other relationships except that they belong to the same set.

Linear: there is a one-to-one relationship between data elements.

Tree Structure: there is a one-to-many relationship between data elements.

Graph or mesh: There are many-to-many relationships between data elements

3. data structure definition

Data_structure = (D, S)

The data structure is a binary group, where D is a finite set of data elements, and S is a set of relationships on D.

4. What is a data type?

Data types include a set of values and a set of operation sets defined on them, that is, the data structure of the Operation object and corresponding operations.

5,AlgorithmFive features

Poor, deterministic, feasible, input, and output

6. algorithm design requirements

Correctness, readability, robustness, efficiency and storage

7. algorithm efficiency measurement

Algorithm time complexity + algorithm space complexity

Algorithm time complexity: The measurement level of the number of repeated executions of one of the deepest original operations in the algorithm. t (n) = O (f (n ))