搜索资源列表
Hanoi-new
- 最新自编vb汉诺塔小程序，可自行演示汉诺塔-demonstration of the VB program to explain how the VB simple animation to achieve and control
hanoi-vb
- 自编vb汉诺塔小程序，可直接在vb下运行-Vb own Tower of Hanoi applet can be run directly in vb
Hanoi102
- 经典的小游戏，汉诺塔，简单的代码示例，适合新手进行入门示例-Classic game, Tower of Hanoi, a simple code example, an example entry for novices
hanoi103
- 汉诺塔的小程序，学习用，用于递归的方法的学习，简单但是实用哦-Tower of Hanoi applet, learn to use, for the recursive method of learning, a simple but practical Oh
HanoiTower100
- 最近在学用API写windows程序,经过半天的努力写出了一个汉诺塔演示程序.程序短小精悍,能完整地完成盘子的移动过程.-Recent study using API to write windows procedure, after the efforts of a half-day Tower of Hanoi to write a demo program. Dapper procedures can be completed full course of plate movement.
hanoi（Titan）
- 汉诺塔解答程序，通过递归实现，好多书上都有这个练习题吧-HANOR answer process, through recursive, many of the books have it Exercises
Hanoi
- 汉诺塔小程序，递归的算法编写，使用C语言。-The code of Hanoi, based on recursion, using C language.
HNTower
- 汉诺塔游戏，可以手工移动，也可以自动操作。可以学习线程，图像操作等-Hanoi game, you can manually move, can automatic operation. Can learn the thread, image operation, etc.
Hanoi
- 汉诺塔问题的动态演示程序，可以调整运行速度。-Hanoi problem dynamic demonstration program, can adjust the speed.
hanoi-master
- html和js,模拟汉诺塔运行,熟悉下数据结构-html and js, Tower of Hanoi simulation run, become familiar with the data structure
hanoi
- 这是一个简单的汉诺塔小程序,刚开始学C++时所编写-A tower of Hanoi applet
Hanoi
- 汉诺塔演示，用java编写的简单的汉诺塔演示程序，可直接运行-Tower of Hanoi demo, using java prepared a simple Tower of Hanoi demo program can be run directly
suanfasheji
- 常见算法设计与分析源代码，包括背包问题，n皇后问题，大整数乘法，阶乘问题，汉诺塔等-Common algorithm design and analysis of source code, including the knapsack problem, n queens problem, large integer multiplication, factorial problem, Tower of Hanoi, etc.
Hanoi100
- 在VC++6.0环境下对汉诺塔问题的简单实现。希望有所用-In VC++6.0 environment issues under the Tower of Hanoi simple to achieve. Want to be with
hanoi
- 汉诺塔可视化MFC演示，功能还算完善，其中栈的状态需要改进-Tower of Hanoi Visualization MFC Demo
towersofhanoi
- 汉诺塔小游戏，简单实现移动步骤，输入个数，运行出每一步的操作过程-Tower of Hanoi game, simple steps
hannuota
- 汉诺塔演示过程，通过选择个数，分别实现了从开始到最后的完成的过程-Tower of Hanoi demo process, by selecting a number, were realized the beginning to the end of the completion proces
MainClass
- 汉诺塔（又称河内塔）问题是源于印度一个古老传说的益智玩具。大梵天创造世界的时候做了三根金刚石柱子，在一根柱子上从下往上按照大小顺序摞着64片黄金圆盘。大梵天命令婆罗门把圆盘从下面开始按大小顺序重新摆放在另一根柱子上。并且规定，在小圆盘上不能放大圆盘，在三根柱子之间一次只能移动一个圆盘。 后来，这个传说就演变为汉诺塔游戏，玩法如下: 1.有三根杆子A,B,C。A杆上有若干碟子 2.每次移动一块碟子,小的只能叠在大的上面 3.把所有碟子从A杆全部移到C杆上 以下实例演示了汉诺塔算
hannuota
- 汉诺塔问题。程序结果：给出程序执行过程中栈的变化过程与圆盘的搬动状态。-Tower of Hanoi problem. Program Results: give the program execution stack moving process and the disk status changes.
hannuota
- 汉诺塔问题。程序结果：给出程序执行过程中栈的变化过程与圆盘的搬动状态。-Tower of Hanoi problem. Application results: the execution of a program is given the changing process of the stack and moving state of the disk.