搜索资源列表
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
shuhuan
- 几个C的小程序，有汉诺塔，数环打印，链表的创建并自动排序 -several small programs, Tower of Hanoi, several Central Print, Chain automatically create and order
K1
- hanoi塔经典问题，采用递归算法,值得研究研究-Hanoi tower classic, using recursive algorithm, it is worth studies
C++Builder1.2
- 用c++builder編寫的漢諾塔實例，-c builder with the preparation of the Tower of Hanoi example,
Demo01-TowersofHanoi
- 以图形界面的方式形象的描述了数据结构中翰诺塔的过程-graphical interface to the image descr iption of the data structure Brigham Young Tower of the process
TriHANOI
- 自己写的汉诺塔程序,IDE是TC2.0 程序特点: 1)三根柱子都有若干盘子 2)程序可演示运行过程 编译时需要根据实际情况修改下面这句: initgraph(&driver,&mode,\"c:\\\\TC2\\\\BGI\") -himself wrote the Tower of Hanoi procedures, IDE process is TC features : 1) three pillars have a number plate 2) demons
hruota
- 我用C编写的汉诺塔算法的源程序，自认为写的不错，呵呵- I use the Chinese which C compiles to promise the tower algorithm the source program, confessed for writes is good, ha-ha ,C-C++,控制台编程/Console
常见算法及函数源代码
- 算法设计与分析 1. 用直接递归方法计算n！： （2）通过键盘输入n的值，（ 2. 用直接递归方法计算第n个Fibonacci数： 3. 用直接递归方法计算Ackerman函数： 4. 用直接递归方法给出n个元素的全排列： 8. 用直接递归方法求解Hanoi塔问题 ,Algorithm Design and Analysis 1. Using direct recursive meth
Tower
- 用递归算法在vc中实现多层hanoi塔，程序实现动画显示-Recursive algorithm used in vc achieve multi-storey tower hanoi, procedures to achieve animation show
zhan
- 数据结构C语言对栈的操作，有链栈出栈、入栈的算法，顺序栈出栈、入栈的算法，hanoi塔的算法-C language data structure for stack operation, there is a chain of stack stack入栈algorithms, the order of the stack stack,入栈algorithm, hanoi tower algorithm
hannuo
- 数据结构中经典的汉诺塔算法。就是用递归移动盘子的问题。-Data structure in the classic Tower of Hanoi algorithm. Is to use recursive mobile plate problem.
Tower-of-Hanoi
- 数据结构中，运用链表实现经典汉诺塔的移动。程序运行在控制台上。-Data structure, use the list to achieve the classic Tower of Hanoi s move. Program running on the console.
Hans-tower
- 相传印度教的天神梵天在创造地球这一世界时，建了一座神庙，神庙里竖有三根宝石柱子，柱子由一个铜座支撑。梵天将64个直径大小不一的金盘子，按照从大到小的顺序依次套放在第一根柱子上，形成一座金塔，即所谓的梵塔(又称汉诺塔)。天神让庙里的僧侣们将第一根柱子上的64个盘子借助第二根柱子全部移到第三根柱子上，即将整个塔迁移，同时定下3条规则： (1)每次只能移动一个盘子； (2)盘子只能在三根柱子上来回移动，不能放在他处； (3)在移动过程中，三根柱子上的盘子必须始终保持大盘在下，小盘在上。
Tower-of-Hanoi
- 汉诺塔数据结构编程的源代码，有趣的小程序-Tower of Hanoi data structure programming，it s a interesting program.
C-language-practice-hans-tower
- 简单实现汉诺塔计算，不是很复杂，此过程使用递归算法-Simple to implement han s calculation tower, not very complex, this process using recursion algorithm
tower-of-hanoi
- tower of hanio program in data structure
Tower-of-Hanoi
- Tower of Hanoi,Tower of Hanoi-Tower of Hanoi
tower-issue
- 数据结构 动态规划算法 数塔问题的C语言代码-C language code number of dynamic programming algorithm data structure tower issue
Tower-of-Hanoi
- 该文件包括了非递归、换位递归、汉诺塔、汉诺塔2、汉诺塔画图版、四塔、四塔2这7个c源文件-The document includes a non-recursive, transposition recursion, Tower of Hanoi, Hanoi Tower 2, Tower of Hanoi drawing version, four towers, four towers 2 7 c source files
tower-of-Han
- 此为汉诺塔程序，汉诺塔层数为输入变量,其它不需要输入-This is the Tower of Hanoi program, Hanoi layers as input variables