搜索资源列表
hanno
- 这是用VB 开发的一个汉诺塔程序-This is a development of the VB HANOR procedures
ta
- 用C编的hanno塔-C series Hanno tower
Hanno
- 这是一个关于汉诺塔的程序，介绍了关于汉诺塔的操作
hanno
- 这是一个汉诺塔游戏的原代码,tc环境.可是图型界面的哦~~,不要认为是一般的递归了!-HANOR the original game code, tc environment. However, the map-based interface ~ ~ Oh, do not believe that the general recursion!
hanno
- /汉诺塔递归算法过程解析: //汉诺塔（又称河内塔）问题是印度的一个古老的传说。开天辟地的神勃拉玛在一个庙里留下了三根金刚石 //的棒，第一根上面套着64个圆的金片，最大的一个在底下，其余一个比一个小，依次叠上去，庙里的众僧 //不倦地把它们一个个地从这根棒搬到另一根棒上，规定可利用中间的一根棒作为帮助，但每次只能搬一个， //而且大的不能放在小的上面。解答结果请自己运行计算，程序见尾部。面对庞大的数字(移动圆片的次数) //18446744073709551615，看
Hanno
- 这是用prolog编写的汉诺塔小程序，包括了源程序以及相关的实验说明文档。可直接在prolog中运行。-It is written in prolog Tower of Hanoi applet, including source code and related documentation of experiments. Can be run directly in the prolog.
hanno
- 简单的汉诺塔程序 用于的动态显示 排列过程-Simple Tower of Hanoi program arranged for the dynamic display during
hanoi01
- 汉诺问题：古代有一个梵塔，塔内有三个座A,B,C，要将A座大小不等的64个盘子借助B座移动到C座上，并且保持大盘子在下，小盘子在上。运用递归的方法解决~-Hanno problem: there is a Vatican ancient tower, the tower has three Block A, B, C, to A Block, plate sizes 64 to move to C through B, seat, and keep the next platter of sma
hanno
- 汉诺塔 汉诺塔的程序编码 求次数和运算步骤-hanno
Hanno
- 算法设计课程中介绍到的汉诺塔的实现代码，汉诺塔是很经典的案例。-Algorithm design course introduction to the north tower of the han the realization of the code, han s tower is a classic case.
hannuo
- 输入汉诺塔层数，输出移动路径，例如，A到B就会显示a→b，数量不要过多否则容易死机。简单的小程序，仅供参考-hanno，input number
CRM_WORKSHOP_napoli_18_09_v2
- CRM workshop I risultati di questa scelta hanno un impatto significativo sulla struttura economico-finanziaria di lungo periodo
Hanno
- Hanno塔非递归实现，用c写的非递归实现Hanno塔问题。-The Hanno tower of non-recursive
test_im
- 汉诺塔 首先实现柱子柱子间的的移动 然后实现汉诺塔-hanno move
hanno
- 这是一个汉诺塔游戏的原代码,tc环境.可是图型界面的哦~~,不要认为是一般的递归了!-HANOR the original game code, tc environment. However, the map-based interface ~ ~ Oh, do not believe that the general recursion!
HanNo
- RISCV工具链生成的中间程序，程序目的为汉诺算法程序-RISCV tool chain generated in the middle of the program, purpose as Hanoi algorithm application