Recursive functions of C + +

Recursive implementation of the Hanoi tower problem.

Have to say very complicated, think of a night just figured out the implementation of the process, do not know which great man to come out of, unexpectedly recursive use so superb, I can not wait.

1#include <iostream>2 using namespacestd;3#include <string>4 5 voidMoveCharXChary)6 {  7cout<<x<<" -"<<y<<Endl; 8 } 9 Ten  One voidFintNCharOneCharBoth,Charthree) { A     if(n = =1){ - Move (one,three); -}Else{ the         //first, the n-1 plate on A is moved to B by means of C, -         //then move the last large plate on a to C, -        //Finally, the n-1 plate on B is borrowed from Group A to C . -F (N-1, one,two,three); + Move (one,three); -F (N-1, two,one,three); +     } A } at intMain () { -      intm;  -cout<<"Enter the number of plates:";  -Cin>>m;;  -F (M,'A','B','C');  -}

Recursive functions of C + +