Algorithm design and analysis-Electronic Industry Press

Chapter 1 Algorithm Overview
Chapter 2 recursion and sub-Governance
Recursion
Concept: directly or indirectly calling its own algorithms
Example:
Factorial
Fibonacci Series
Ackerman Function
Sorting Problems
Integer Division
Hanoi Tower Problems
Sub-Governance
Concept: divides a problem with a scale of N into k subproblems with a smaller scale. These subproblems are independent of each other and the same as the original ones. These subproblems are solved through recursion, merge the obtained subproblem into the original problem.
Example:
Binary Search
Big integer multiplication
Strassen Matrix Multiplication
Board coverage
Merge and sort
Quick sorting
Linear Time Selection
Closest Point-to-Point Problem
Round Robin schedule

Chapter 3 dynamic planning
Concept: similar to the method of separation and control, the problem to be solved is also divided into several subproblems. The subproblems are solved first and then the original problems are solved. Different from the divide and conquer problem, it is suitable for Dynamic Planning and solving problems. The subproblems obtained through decomposition are often not independent.

Chapter 4 greedy Algorithms

Greedy policy and greedy choice

Chapter V backtracking

Deep Search for subset tree or arrangement tree

Chapter 6 branch Restriction

Search the subset tree in breadth and set bound ()