Description: 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.
To Search:
File list (Check if you may need any files):
code\1.cpp
....\2.cpp
....\3.cpp
....\4.cpp
....\5.cpp
code
Download