搜索资源列表
hannoi
- 汉诺塔问题c语言实现 递归方法-Tower of Hanoi Tower of Hanoi problem c language c language recursion problem
Sunnypig
- vijos上一题Sunnypig闯罗塔关（汉诺塔问题中最难的一种问法）。 没做出来的可以参考一下。-a title vijos Rota Sunnypig Chuang Guan (Tower of Hanoi problem in a most difficult question is asked). Can not do by reference.
1
- 小程序来的，是关于汉诺塔游戏问题的小程序-Small procedures is on the issue of Tower of Hanoi game applet
hannoi
- 本程序通过用递归调用的方法实现了汉诺塔问题,这是一个通用的程序,通过输入的层数结果输入到一个out.txt的文件中-This procedure by using the method of recursive calls a Tower of Hanoi problem, which is a common procedure, the results by entering into the layers of a document out.txt
hanoi
- 解决汉诺塔问题，不用递归方法，而用堆栈模拟，算法简单速度快-solve Hanoi problem
Ex4
- 用普通递归与消除尾递归的方法实现解决汉诺塔问题-With ordinary recursive method of elimination of tail-recursive Towers of Hanoi problem to achieve a solution
Hanoi
- 汉诺塔问题,古典的一个数学问题，如果人来做，当盘子达到十几个，人力就难及了。-Towers of Hanoi problem, a classical mathematical problem, if people do, when the plate reached a dozen, and the manpower it will be difficult.
hanoi
- 汉诺塔问题的实现！主要用相关的数据结构和算法，对于数据结构的学习很有帮助！-hanoi implementation,data structure,algorithm
hanoinew
- n阶汉诺塔问题 手动敲代码。移动的次序也会打印。-n-order Tower of Hanoi problem manually knock code. The order will move the print.
hannuota
- 利用汉诺塔问题的对称性，写的一个非递归解法。-a new algorithm of Tower of Hanoi problem , written in a non-recursive solution.
hannuota
- 使用C++语言来解决汉诺塔问题,给出程序的代码以及运行结果的snapshot，并通过画程序流程图来说明代码-use the c++ language to resolve the problem of hannuota
hanoi
- 这是一个用C语言实现的汉诺塔问题,希望对于大家有所帮助-This is a C programe about hanoi
Tower-Of-Hanoi
- 汉诺塔问题求解 输入n 输出搬移序列-Tower of Hanoi
hannuota
- 本程序可以实现简单的三界汉诺塔问题，可以直接编译，运行处结果。-The program can achieve a simple three realms Tower of Hanoi problem, can be directly compiled and run at the results.
Hanoi
- 一个简单的小程序实现 汉诺塔问题，本方法简单易于接受-Towers of Hanoi problem
hannnuota.rar
- 一个具有解决汉诺塔问题的程序，里面的参数大家可以自定义，方便供像我一样的初学者学习,A program to solve the Towers of Hanoi problem inside the parameters we can customize, easy for a beginner like me to learn
main
- 汉诺塔问题的递归处理，程序简洁，可改动性强。-Tower of Hanoi recursive processing.
Hannuota
- 数据结构中的经典问题，汉诺塔问题的程序代码，需要的给-Tower of Hanoi program
汉诺塔
- 有A,B,C三个柱子，将A柱子上的N个盘子（从大到小排列）移到C柱子上，每次只允许移动一个盘子，并且保证每个柱子上的盘子的排列都是从大到小。(There are three columns, A, B and C, which move the N plates on the A pole from the big to the small to the C pole, and only allow one plate to move each time, and ensure that the
hannuota
- 使用C++语言解决了汉诺塔问题（三柱），可以依次拓展到多柱(The use of C++ language to solve the problem of Hanoi , which in turn may be extended to multiple columns)