数据机构-递归实现汉诺塔C 程序.doc

文档介绍：#include<>intc=0;voidmove(charx」ntn,charz){printf("%%dfrom%cto%c\n"/++c/n/x,z);}voidhanoi(intnzcharx,charyzcharz)〃将塔座x上按直径由小到大且自上而下编号1至n的n个圆盘按规则搬到〃塔座z上,y用作辅助塔。〃搬动操作move(x,n,z)可定义为(c是初值为0的全局变暈对搬动计数)://printf("%%ifrom%cto%c\n"/++c/n,x,z);{if(n==l)move(x,l,z); 〃将编号为1的圆盘从x移到zelse{hanoi(n・l,x,乙y);〃将x上编号为1至n-1的圆盘移到y,z作辅助塔move(x,nzz); 〃将编号为n的圆盘从x移动啊zhanoi(n・l,y,x,z);〃将y上编号为1至n-1的圆盘移到z,x作辅助塔}//else}//hanoivoidmain(){intn;charx,y,z;printf(n请输入汉诺塔的圆盘数n:”);scanf(”%d”,&n);hanoi(n;x,;y,;z,);