搜索资源列表
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
Hanoi非递归
- Hanoi非递归源码-Hanoi non - recursive FOSS
hanoi
- 用C语言递归算法实现的n层hanoi塔问题解决
Hanoi
- hanoi 是一个用递归算法计算“汉诺塔”的经典递归程序
hanoi
- hanoi
递归解决Hanoi汉诺塔
- 解决Hanoi问题
hanoi.2957
- como resolver la torre de hanoi
hanoi
- 不利用递归实现汗诺塔- Does not use the recursion realization perspiration promise tower
hnoi
- 一个汉诺塔示例程序-Tower of Hanoi example of a procedure
Hanoi
- 实现了汉诺塔算法，和C语言课本中的算法相似。-Realized the Tower of Hanoi algorithm, and the C language algorithm similar textbooks.
hanuo
- 汉诺塔问题的递归实现 说明很详细 大家可以自由下载哦-Recursive Tower of Hanoi problem in great detail the realization that you can freely download Oh
Hanoi
- 采用c++语言，用递归方法来实现汉诺塔。-The use of c++ Language, recursive method used to achieve the Tower of Hanoi.
hannuota
- 用c++的MFC写的汉诺塔程序，可自由选择塔的层数，运行过程中实现塔的自动移动；-With c++ The MFC write Tower of Hanoi procedures, are free to choose the low-rise tower, tower to run the course of the realization of the automatic movement
hannuota
- 汉诺塔的实现，计算家编程大作业，面向对象编程练习-Implementation of the Tower of Hanoi
Hanio
- 这是一个小游戏，也是用vc++缟的，用的是汉诺塔数学原理。-This is a game, but also with the vc++ Pseudocaranx, using a mathematical principle of Tower of Hanoi.
Hanoi
- 汉诺塔问题的非递归解决，能够用非递归的方法解决汉诺塔问题-Tower of Hanoi non recursive solution can be non-recursive solution to the Tower of Hanoi problem
hanoi
- 汉诺塔（又称河内塔）问题是印度的一个古老的传说。开天辟地的神勃拉玛在一个庙里留下了三根金刚石的棒，第一根上面套着64个圆的金片，最大的一个在底下，其余一个比一个小，依次叠上去，庙里的众僧不倦地把它们一个个地从这根棒搬到另一根棒上，规定可利用中间的一根棒作为帮助，但每次只能搬一个，而且大的不能放在小的上面。-Tower of Hanoi (also known as the Hanoi tower) problem is an ancient Indian legend. Epoch-making
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