Introduction - If you have any usage issues, please Google them yourself
The first chapter is an introduction to Algorithms
1.1 algorithms and programs
Abstraction mechanism of 1.2 expression algorithm
1.3 description algorithm
Complexity analysis of 1.4 algorithms
Summary
exercises
The second chapter recursion and divide and conquer strategy
The concept of 2.1 speed return
The basic idea of 2.2 points therapy
2.3 two point search technology
Multiplication of 2.4 integers
2.5 Strassen matrix multiplication
2.6 checkerboard coverage
2.7 merge sort
2.8 quick sort
2.9 linear time selection
2.10 closest point pair problem
2.11 round robin calendar
Summary
exercises
The third chapter dynamic planning