Introduction - If you have any usage issues, please Google them yourself
Use backtracking to solve the typical problems of algorithms: knight tour problem, n queens problem 0-1 knapsack problem. Use recursion and divide and conquer strategy to solve several problems of arithmetic: Hanoi tower problem and binary search technique.