搜索资源列表
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
- 用C语言递归算法实现的n层hanoi塔问题解决
hanoi
- hanoi
递归解决Hanoi汉诺塔
- 解决Hanoi问题
hanoi
- 汉诺塔（又称河内塔）问题是印度的一个古老的传说。开天辟地的神勃拉玛在一个庙里留下了三根金刚石的棒，第一根上面套着64个圆的金片，最大的一个在底下，其余一个比一个小，依次叠上去，庙里的众僧不倦地把它们一个个地从这根棒搬到另一根棒上，规定可利用中间的一根棒作为帮助，但每次只能搬一个，而且大的不能放在小的上面。-Tower of Hanoi (also known as the Hanoi tower) problem is an ancient Indian legend. Epoch-making
hanoi
- Hanoi塔问题非递归算法实现，几个具体的实现算法-Tower of Hanoi non-recursive algorithm, the realization of a number of specific algorithms
Hanoi-Stack
- Hanoi Stack source code, that s one of data structure problems
hanoi
- hanoi C语言编码 希望帮助有需要的人-hanoi C language code want to help people in need
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
- 数据结构中著名的汉诺塔问题的实现，基于C++实现-Data structure of the famous Tower of Hanoi problem to achieve, based on C++ implementation
hanoi
- Hanoi塔的递归调用和消除尾递归的方法，附带算法的设计思路和分析-Hanoi Tower recursive calls and the elimination of tail recursion method with the algorithm design and analysis of ideas
Hanoi
- Hanoi，用分治法解决汉诺塔问题，vc6.0编译运行通过-Hanoi, Tower of Hanoi with the Method to solve the problem, vc6.0 compile and run through
hanoi
- 自己写的汉诺塔，演示移动过程。具体说明怎么实现-hanoi
Hanoi
- 用C语言实现汉诺塔的基本功能，用到图形驱动-Tower of Hanoi with the C language the basic functions, use graphics driver
Towers-of-Hanoi-problem
- 用递归算法实现汉诺塔问题,并输出所移动的步数-Towers of Hanoi problem using recursive algorithm,and output the number of the movement
hanoi
- C语言中的经典算法：哈诺塔问题，递归调用的经典应用-hanoi in C language
HANOI
- 汉诺塔算法，实现汉诺塔的内部模拟演示，不输出至终端，要显示自行修改代码-Tower of Hanoi algorithm, the Tower of Hanoi' s internal simulation demonstration, not output to the terminal, modify the code to be displayed
hanoi
- 汉诺塔问题，能够解决碟子数任意多的汉诺塔问题，而且程序显示碟子从哪个柱子移动到哪个柱子-The problem of Hanoi, to solve the problem of Hanoi with any number of plates, moreover, the program display the movement the plate .
Tower-of-Hanoi
- 学会怎么样用递归的方法来巧妙的求解汉诺塔-Learn what happens to the clever use of recursive methods for solving the Towers of Hanoi
Hanoi
- C#写的动态显示汉诺塔移动过程的小程序。使用了线程技术，同步技术。-write in C#, display the moving procedure of the Tower of Hanoi. The use of threading, synchronization.