Advantages are simple

Can clearly indicate the operation process

Easy to understand design intent

Simple

Correctness, readability, robustness, efficiency

Hardware speed, problem size, fairness, programming effort, program quality, compilation quality

The time complexity of the algorithm is related to the size of the input data

fixed part, variable part

Recursion has the characteristics of self-description and self-reproduction

Recursive execution is divided into two stages: recursion and backtracking.

The function stops when it meets a certain boundary condition

Problems with recursive use

Basic conditions for recursion

Recursive determination

Iteration is the use of the original value of the variable to derive the new value of the variable.

Determine the iteration model, establish iteration relationships, and control the iteration process

The relationship between data elements is called data structure

Set structure, linear structure, tree structure, and graph structure

In practical applications, the forms of linear tables include data structures such as strings, one-dimensional arrays, stacks, queues, and linked lists.

Features: first in, first out

Features: First in, last out

There is a pointer

All problems with hierarchical or inclusive relationships can be described using a tree structure.

Characteristics of a binary tree: every node except leaves has two subtrees

Tree traversal refers to searching along a certain route and visiting each node in the tree once and only once.

Advantages: Simple, easy to understand and intuitive

Disadvantages: May create overly complex rules

The methods of storing graphs mainly use adjacency matrices and adjacency lists.

Visit all vertices in the graph from a certain vertex and each vertex is visited only once

Collections saved on external storage media in a certain format

b-tree

b tree

Optimization of b-trees

Advantages of b-tree and b-tree