hanoi塔算法.txt

数据结构C语言对栈的操作

/*Hanoi.txt*/
    main()
   {   int m;
       printf("Input the number of disks:");
       scanf("%d",&m);
       printf("The steps to moving %3d disks:\n",m);
       hanoi(m,'A','B','C');
(0) }

     void hanoi(int n,char x,char y,char z)
(1)  {
(2)     if(n==1)
(3)         move(1,x,z);    //将第1号盘子从A移到B上
(4)     else{
(5)            hanoi(n-1,x,z,y);  //将n-1个盘子从A移到B上，借助于C
(6)            move(n,x,z);      //将第n号盘子从A移到C上
(7)            hanoi(n-1,y,x,z);//将剩下的n-1个盘子从B移到C上，借助于A
(8)         }
(9)  }

     void move(int h,char c,char f)
     {
        printf("%d:%c--->%c\n",h,c,f);
     }