搜索资源列表
hannuota
- 用汇编解决汉诺塔问题，可以求15块板以下的方案。
Hanoi
- 汉诺塔问题的非递归解决，能够用非递归的方法解决汉诺塔问题-Tower of Hanoi non recursive solution can be non-recursive solution to the Tower of Hanoi problem
hannuota
- 解决关于汉诺塔的问题，利用递归的知识，很经典的小程序-To solve the problems on the Tower of Hanoi, the use of recursive knowledge, it is a classic applet
hanoi
- 递归调用方式给出汉诺塔的调动序列，实现hanoi问题的自动解决-Recursive call gives way to mobilize the Tower of Hanoi sequence, to achieve an automatic solution to the issue of hanoi
Hamoi
- 采用递归思想解决汉诺塔问题：详细的步骤分析，算法分析和实现。采用C++语言，可加深对递归函数的理解和应用。-Using the recursive thinking to solve Towers of Hanoi problem: detailed steps analysis, algorithm analysis and implementation. Using C++ language, can deepen the understanding and application of r
hanoi
- 经典算法解决三柱汉诺塔问题，并根据J.S.Frame算法设计出解决四柱汉诺塔问题的程序实现-Classical algorithm to solve the the three the column HANOR problem, designed and according JSFrame algorithm program Peg Hanoi Tower problem