搜索资源列表
经典汉诺塔问题c语言版
- 汉诺塔是初学数据结构的同学最头疼的问题，这里是一个用递归函数解决汉诺塔问题的经典c语言程序，里面有代码和执行文件。-HANOR data structure is that when the students most headaches, here is a solution using a recursive function HANOR a classic c language program, which has code an
演示汉诺塔问题
- 汉诺塔问题的示例-HANOR examples of problems
汉诺塔问题的C#实现
- 利用递归算法实现了汉诺塔问题的求解步骤
演示汉诺塔问题
- 汉诺塔问题的示例-HANOR examples of problems
Hanoi_digui
- 用递归的方法解决汉诺塔问题的思想。-using recursive solution to the problem HANOR thinking.
汉诺塔(Hanoi)
- 一个汉诺塔问题的模拟程序,包含图形模拟和过程同步显示(华南农业大学信息学院计算机系).-one of the simulation program, including graphics simulation and process synchronization Display (South China Agricultural University, Department of Computer Information Instit
汉诺塔课程设计（修改后）
- 汉诺塔演示程序，用VB做成的图形界面，能够实现汉诺塔问题，也即是把N个盘子从一根棍上移到另一根上面，通过中转的棍，但是必须保证在每根棍上都是下面的盘子大于上面的盘子。-HANOR demo program using VB create graphical interface to HANOR problems, that is, N dishes from one club to another on the above-throug
经典汉诺塔问题c语言版
- 汉诺塔是初学数据结构的同学最头疼的问题，这里是一个用递归函数解决汉诺塔问题的经典c语言程序，里面有代码和执行文件。-HANOR data structure is that when the students most headaches, here is a solution using a recursive function HANOR a classic c language program, which has code an
hanoil
- 汉诺塔问题的代码 仅可做参考 嘻嘻^_^-HANOR the only available source reference hee hee ^ _ ^
hanoie
- 很好的一个汉诺塔问题的解法，方法非常灵活有效-good HANOR a solution to the problem, the method is very flexible and effective
hnt
- 汉诺塔问题的另一种解法，方法非常灵活有效，运行效率高-HANOR of another solution, a very flexible and effective method, high efficiency operation
hanoisea
- 该程序用非递归的方法实现了汉诺塔问题的求解。当源盘的数目较少时该算法的执行速度比递归算法快，但当源盘块数较多时递归算法执行速度块-the program with non- recursive method of the Tower of Hanoi problem solving. When the source of the relatively small number of sites at the time of the al
AutomaticdemonstratioHanoiTower
- 汉诺塔自动演示 此程序经过编译后运行你可以对汉诺塔问题有更深刻的认识-HANOR demonstration of this process automatically after you run the compiler can HANOR issue in a more profound understanding of
Hanoi
- 采用递归循环的方法求解汉诺塔问题，程序很简洁也很实用-Using recursive method for solving the cycle of Tower of Hanoi problem, the procedure is very simple and practical
Hano
- 1.有三根杆子A,B,C。A杆上有若干碟子 2.每次移动一块碟子,小的只能叠在大的上面 3.把所有碟子从A杆全部移到C杆上 经过研究发现，汉诺塔的破解很简单，就是按照移动规则向一个方向移动金片： 如3阶汉诺塔的移动：A→C,A→B,C→B,A→C,B→A,B→C,A→C 此外，汉诺塔问题也是程序设计中的经典递归问题-1. Has three pole A, B, C. A pole has a
hanoi
- 递归方法的汉诺塔问题，网上大多没有界面，这个有界面，有游戏功能！-Recursive method of Hanoi Tower problem, on-line do not have any interface, this interface has gaming features!
suanfashiyan
- 冒泡排序和汉诺塔问题的递归算法实验报告好东西来下载啊-Bubble Sort and Tower of Hanoi " problem of the recursive algorithm experimental reports, good things to download ah
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 unde
1
- 汉诺塔问题的解决，C++递归实现汉诺塔问题(Solving Hanoi problem)
汉诺塔
- C++实现的汉诺塔小游戏 汉诺塔：汉诺塔（又称河内塔）问题是源于印度一个古老传说的益智玩具。大梵天创造世界的时候做了三根金刚石柱子，在一根柱子上从下往上按照大小顺序摞着64片黄金圆盘。大梵天命令婆罗门把圆盘从下面开始按大小顺序重新摆放在另一根柱子上。并且规定，在小圆盘上不能放大圆盘，在三根柱子之间一次只能移动一个圆盘。(C++ implementation of the tower of Hanoi game Hanoi Hano