递归算法-汉诺塔.doc

文档介绍：实验二、递归算法一、写出汉诺塔问题的递归算法程序。给出n=3和n=4时,圆盘的移动总次数(程序中统计)和每步移动过程。二、源程序#include""#include""#include""move(chara,charb,intm){intn;n=m;printf("此为第%d个盘子移动的步骤:\n",n); printf("%c-->%c\n",a,b); }staticintcount;hanoi(intn,charx,chary,charz){if(n==1) { move(x,z,n); count++; } else { hanoi(n-1,x,z,y); move(x,z,n); count++; hanoi(n-1,y,x,z); }}main(){ charx,y,z; intn;count=0; SYSTEMTIMEsys1,sys2; printf("请输入盘数:\n");scanf("%d",&n); GetLocalTime(&sys1);hanoi(n,'x','y','z'); printf("汉诺塔移动的总次数是%d:\n",count);GetLocalTime(&sys2);printf("%dmsecondspassed.\n",((-)*1000+-));}