文件名称:huihanoi
介绍说明－－下载内容均来自于网络，请自行研究使用
递归方法实现HANOI塔问题
子程序模块个数不限。要求: 盘子个数可以输入,第一个塔为A,第二个塔为B,第三个塔的名称为C。打印出移动过程。
-Recursive methods HANOI tower realize the number of open issues subroutine modules. Requirements: the number plate can enter, the first tower for A, the second tower for the B, the third tower of the name C. Print out the move.
子程序模块个数不限。要求: 盘子个数可以输入,第一个塔为A,第二个塔为B,第三个塔的名称为C。打印出移动过程。
-Recursive methods HANOI tower realize the number of open issues subroutine modules. Requirements: the number plate can enter, the first tower for A, the second tower for the B, the third tower of the name C. Print out the move.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
huihanoi
........\hanoi.asm
........\hanoi.exe
........\hanoi.lst
........\hanoi.obj
........\hanoi.asm
........\hanoi.exe
........\hanoi.lst
........\hanoi.obj