1. Logical structure of data:

2. Data storage structure:

3.Data operations:

Abstract data types of a data structure include:

Linear table: represents a repeatable unordered set, with predecessor and successor order relationships between elements; the keywords of different elements can be repeated, and the serial number can be used to identify data elements with repeated keywords.

Sorted linear list: Represents a repeatable sorted set, with elements sorted in key size order.

Hash table: represents a non-repeatable unordered set, the element keys do not repeat, there is no order between elements, and there is no sorting.

Binary sorting tree: represents a non-repeatable sorted set, the element keywords are not repeated, and the elements are sorted in ascending/descending order by the keywords.

Characteristics of the algorithm:

Algorithm design goals:

The time efficiency of an algorithm refers to the tendency that the execution time of the algorithm increases with the increase of the problem size. Time complexity is usually used to measure the time efficiency of the algorithm. T(n)=O(f(n))

Space complexity refers to the additional memory space required to solve the problem when the algorithm is executed, excluding the storage space occupied by input data. S(n)=O(f(n))