Data Structure Overview

First, the basic concept of the algorithm

The process of solving a computer problem is actually implementing some kind of algorithm, which is called computer algorithm.

1, the basic characteristics of the algorithm: feasibility, certainty, poor, with enough information.

2, the basic elements of the algorithm: the algorithm of data operation and operation, the control structure of the algorithm.

3, the basic method of algorithm design: Enumeration method, inductive method, recursion, recursion, half recursive technology, backtracking method.

4. Algorithm design requirements: Correctness, readability, robustness, efficiency and low storage requirements

Second, the complexity of the algorithm

1. Time complexity: Refers to the computational effort required to perform the algorithm

2. Space complexity: the memory space required to execute this algorithm

Third, the definition of data structure:

1, the data in the computer organization. Includes logical structure, storage structure.

2. Logical structure: set structure; linear structure; tree structure; graphic structure

3. Storage structure: sequential storage structure; chain storage structure

IV. linear structure (linear table)

Five, tree-shaped structure

VI. GRAPHIC structure

Seven, sort

Eight, find

Copyright NOTICE: This article for Bo Master original article, without Bo Master permission not reproduced.

Data Structure Overview