公共基础总结（Common foundation summary）.docVIP

公共基础总结（Common foundation summary） The first chapter is data structure and algorithm 1.1 algorithm 1. algorithm concept: refers to the solution of the accurate and complete description of the program 2., the basic characteristics of the algorithm: feasibility, certainty, poverty (limited time), enough information The complexity of the 3. algorithm: time complexity and space complexity (1) time complexity: the computational effort required by the algorithm (the number of basic operations performed by the algorithm) (2) spatial complexity: the memory space required to perform this algorithm 1.2 basic concepts of data structures 1., three problems of data structure research (1) logical structure: the data structure that refers to the logical relation between the elements of the response data (2) storage structure (physical structure): the logical structure of data stored in the computer storage space. (3) the operation of various data structures 2. data structure definition: refers to a collection of data elements with structure. The so-called structure refers to the relationship between data elements before and after. In the data structure, the node without the former is called the root node, and the node without the latter is the terminal node (also called the leaf node). 3. an empty data structure: a data structure with no element. 4. types of data structures: linear structure and nonlinear structure. Linear structure: there is only one root node, and each node has at most one antecedent, and at most one post. Nonlinear structure: if a data structure is not a linear structure, it is called a nonlinear structure. 1.3 linear table and its sequential storage The 1. linear list is the simplest and most commonly used linear structure. Structural features of 2. nonempty linear tables: (1) there is only one root node and no antecedent (2) there is only one terminal (leaf) node, and no later (3) the root node and terminal node, all other nodes and there is only one thing bef