Recursion about C + + (take Hanoi as an example)

The recursive problem of C++,hanoi Tower has always been a classic problem, and we often use it when we learn the data structure.

Because of its time complexity and space complexity are very high, we do not recommend the use of this algorithm in practical applications, moving n plates,

Requires 2 of the N power minus one step, for example: 5 plates, 31 steps, 10 plates, 1023 steps.

Below, I tidied up about the C + + recursive code implementation process, I hope that everyone's learning is helpful.

2. #include <iostream>
4. using namespace Std;
6. The first tower for the initial tower, the middle tower for borrowing the tower, the last one tower for the goal tower
8. int step=1; //record number of steps
10. void Move (int n,char from,char to) //The plate numbered n is moved from
12. {
14. cout<< "<<step++<<" Step: "<<n<<" Plate <<from<< "--------" <<to< <endl;
16. }
18. void Hanoi (int N,char from,Char denpend_on,char to)//n plates moved from the initial tower to the target tower (using borrowed towers)
20. {
22. if (n==1)
24. Move (1,from,to); //Only one dish is to move the plate on the first tower to the destination directly
26. Else
28. {
30. Hanoi (N-1,FROM,TO,DENPEND_ON); The first n-1 plate of the initial tower is moved to the borrowed tower with the help of the destination tower.
32. Move (N,from,to); //Move the remaining plate to the destination tower
34. Hanoi (N-1,denpend_on,from,to); //Finally, the n-1 plates on the tower will be borrowed and moved to the destination tower .
36. }
38. }
40. int main ()
42. {
44. cout<<"Please enter the number of plates:" <<endl;
46. int n;
48. scanf ("%d", &n);
50. char x=' A ', y=' B ', z=' C ';
52. cout<<"Plate movement process is as follows:" <<endl;
54. Hanoi (N,X,Y,Z);
56. return 0;
58. }

Recursion about C + + (take Hanoi as an example)