搜索资源列表
Hanoi
- c++编写的汉诺塔解法，利用递归调用的算法-c++ written in Tower of Hanoi solution, using recursive calls of Algorithm
hanoi
- 实现汉诺塔问题。基于算法实现了图形界面的展示-Achieve Tower of Hanoi problem. Algorithm based on a graphic display interface
tower
- 本程序按照古老的汉诺塔的游戏原则设计算法，盘子的层数可以从2个到9个之间选择-The process in accordance with the principles of the ancient Tower of Hanoi game design algorithm, the plate number of layers can be between 2-9 options
hanoi
- 汉诺塔问题，输入盘子数，查询移动步骤以及所需移动的部数！-Tower of Hanoi problem, enter the plate number, and the necessary steps to check mobility of the Department of the number of mobile!
tower
- Draw Tower of Hanoi.
tower-2
- Draw a graphical Tower of Hanoi.
hanoi
- 汉诺塔(hanoi) 1、第归，如搂主的程序 2、用栈实现的非第归 3、非第归，但不用栈来实现，只需要用循环 对于第三个方法，我精确计算过，每一次移动所用的平均开销都是很小的 -Tower of Hanoi (hanoi)
tower
- 完美实现了汉诺塔的搬运方案，只能在命令行里实现其功能-Perfect realization of the Tower of Hanoi' s transportation program, only the command line to achieve its function
Intro2OOP
- source code for tower of hanoi
hanoi
- 汉诺塔的小程序，学习用，用于递归的方法的学习，简单但是实用哦-Tower of Hanoi applet, learn to use, for the recursive method of learning, a simple but practical Oh
Tower
- 汉诺塔的程序，主要是汉诺塔的实现，包括迭方法的应用！-Tower of Hanoi program, mainly the realization of Tower of Hanoi, including the application of the method again and again!
HANOI
- 该源码可以实现汉诺塔的模拟过程，范围为1-99，运行速度取决于主机。-The source of the simulation process can be achieved Tower of Hanoi, the range of 1-99, the speed depends on the host.
Hanoi
- 经典的小游戏，汉诺塔，简单的代码示例，适合新手进行入门示例-Classic game, Tower of Hanoi, a simple code example, an example entry for novices
hanoi-test
- 各种汉诺塔演示代码 汇编和C的 还有不调用堆栈的写法-Code compilation and presentation of various Tower of Hanoi C, there is not the wording of the call stack
HANOI
- 汉诺塔算法，实现汉诺塔的内部模拟演示，不输出至终端，要显示自行修改代码-Tower of Hanoi algorithm, the Tower of Hanoi' s internal simulation demonstration, not output to the terminal, modify the code to be displayed
hanoi
- 用汇编语言编写的汉诺塔程序，结构完整，并且可以查阅作者，时间-Tower of Hanoi in assembly language programs, structural integrity, and can access the author, time, etc.
Hanoi
- C#写的动态显示汉诺塔移动过程的小程序。使用了线程技术，同步技术。-write in C#, display the moving procedure of the Tower of Hanoi. The use of threading, synchronization.
Hanoi
- 用c实现汉诺塔,利用了函数的递归调用及相关数据结构的知识。-Tower of Hanoi with c implementation, using a recursive function calls and associated data structure knowledge.
Hanoi
- 汉诺塔的智力测试游戏。用c编写的，比较简洁，运行耗时短。-Tower of Hanoi game intelligence test. With c written, concise, short-run time-consuming.
Hanoi
- 这是一个简单的汉诺塔问题求解，用递归实现。 输入一个汉诺塔盘子的个数，然后求出具体的移动过程。-This is a simple Tower of Hanoi problem-solving, using recursion. Enter a Tower of Hanoi plate number, and then find the specific process of moving.