汉诺塔C递归算法详细解答2页.docx

汉诺塔C递归算法详细解答程序如下：void move(char x,char y) printf(%c-%cn,x,y);void hanoi(int n,char one,char two,char three)/*将n个盘从one座借助two座，移到three座*/ if(n=1) move(one,three); else hanoi(n-1,one,three,two); move(one,three); hanoi(n-1,two,one,three); main() int n; printf(input the number of diskes:); scanf(%d,&n); printf(The step to moving %3d diskes:n,n); hanoi(n,A,B,C);Hanoi塔问题, 算法分析如下，设A上有n个盘子。如果n=1，则将圆盘从A直接移动到C。如果n=2，则：（1）将A上的n-1（