搜索资源列表
hanoi.zip
- 不利用递归实现汗诺塔
HANOI 塔问题求解
- HANOI 塔问题求解.cpp，HANOI 塔问题是数据结构中具有典型的代表性问题-HANOI tower question solution cpp, the HANOI tower question is in the construction of data has the model the representative question
K1
- hanoi塔经典问题，采用递归算法,值得研究研究-Hanoi tower classic, using recursive algorithm, it is worth studies
hanoi
- 汉诺塔代码,从第一个木桩中,把所有盘子从大到小搬移到第三个木桩中.-HANOR code from a wooden blocks, all the dishes to the smallest movement pickets were third.
hanoi
- 汉诺塔的动画实现，用的是递归的方法，可以自动演示，也可以作为游戏，让用户手动操作。
15
- 用C语言写的,解决Hanoi塔问题.希望对大家有用.
HANOI
- 很多朋友都久等了,这是我做了很久的程序!一个非递归的汗诺塔代码,很好的!
hanoi
- 一个汉诺塔程序 ，游戏虽然很小，但是可玩性很强
hanoi
- 用C语言递归算法实现的n层hanoi塔问题解决
Hanoi
- 用awt实现的汉诺塔的源代码，界面简单大方
递归解决Hanoi汉诺塔
- 解决Hanoi问题
hanoi
- 不利用递归实现汗诺塔- Does not use the recursion realization perspiration promise tower
hanoi
- 递归调用方式给出汉诺塔的调动序列，实现hanoi问题的自动解决-Recursive call gives way to mobilize the Tower of Hanoi sequence, to achieve an automatic solution to the issue of hanoi
hanoi
- Hanoi塔问题非递归算法实现，几个具体的实现算法-Tower of Hanoi non-recursive algorithm, the realization of a number of specific algorithms
hanoi
- 实现汉诺塔的操作步骤输出，可以设置1，2，3三个塔柱，输出结果为用1，2，3表示的操作-Tower of Hanoi the steps to achieve the output, you can set 1,2,3 3 Pylon, the output result of the operation that used 1,2,3
hanoi
- Hanoi塔的递归调用和消除尾递归的方法，附带算法的设计思路和分析-Hanoi Tower recursive calls and the elimination of tail recursion method with the algorithm design and analysis of ideas
Hanoi
- Hanoi塔问题求解，输入盘子的个数，显示运行的 过程-Towers of Hanoi problem-solving, enter the number of plates, showing the process of running
Hanoi-CPP
- Hanoi塔问题一种非递归算法的C++实现 Hanoi塔问题一种非递归算法的C++实现-Towers of Hanoi problem, a non-recursive algorithm C++ to achieve the Towers of Hanoi problem a non-recursive algorithm C++ achieve
Hanoi
- Hanoi塔问题经典算法演示，可以帮助初学者学习-Towers of Hanoi problem classical algorithm shows that can help beginners to learn