Description: Uses backtracking method to solve the problems of the typical algorithms: the knight tour problem, n queen problem, 0-1 knapsack problem.
Recursion and divide and conquer strategy algorithm to solve the problem of few: tower of Hanoi problem and binary search technology.
To Search:
File list (Check if you may need any files):
code\1.cpp
....\2.cpp
....\3.cpp
....\4.cpp
....\5.cpp
code
Download