搜索资源列表
yuanma.rar
- 数据结构的几个小程序：汉诺塔，杨辉三角，括号匹配，表达式求值,Data structure of several small programs: Tower of Hanoi, Yang Hui Triangle bracket matching, regular expression evaluator
honio
- visual C++编写的图形界面的汉诺塔动态演示-visual C++ graphical interface written in the Tower of Hanoi dynamic presentation
hannoi
- 汉诺塔问题c语言实现 递归方法-Tower of Hanoi Tower of Hanoi problem c language c language recursion problem
Sunnypig
- vijos上一题Sunnypig闯罗塔关（汉诺塔问题中最难的一种问法）。 没做出来的可以参考一下。-a title vijos Rota Sunnypig Chuang Guan (Tower of Hanoi problem in a most difficult question is asked). Can not do by reference.
hannuota
- 汉诺塔的动态演示,使用C++实现汉诺塔的动态演示-Tower of Hanoi dynamic presentation, the use of C++, dynamic presentation Tower of Hanoi
hanno
- /汉诺塔递归算法过程解析: //汉诺塔（又称河内塔）问题是印度的一个古老的传说。开天辟地的神勃拉玛在一个庙里留下了三根金刚石 //的棒，第一根上面套着64个圆的金片，最大的一个在底下，其余一个比一个小，依次叠上去，庙里的众僧 //不倦地把它们一个个地从这根棒搬到另一根棒上，规定可利用中间的一根棒作为帮助，但每次只能搬一个， //而且大的不能放在小的上面。解答结果请自己运行计算，程序见尾部。面对庞大的数字(移动圆片的次数) //18446744073709551615，看
hanoi-c++
- 自编c++汉诺塔小程序,可直接在vc++上运行-Self c++ Tower of Hanoi applet can be directly in vc++ Run
hanoi-vb
- 自编vb汉诺塔小程序，可直接在vb下运行-Vb own Tower of Hanoi applet can be run directly in vb
HanoiTower
- 最近在学用API写windows程序,经过半天的努力写出了一个汉诺塔演示程序.程序短小精悍,能完整地完成盘子的移动过程.-Recent study using API to write windows procedure, after the efforts of a half-day Tower of Hanoi to write a demo program. Dapper procedures can be completed full course of plate movement.
1
- 小程序来的，是关于汉诺塔游戏问题的小程序-Small procedures is on the issue of Tower of Hanoi game applet
Tower
- 一个用标准C编写的汉诺塔可视控制台程序,实现了制定层数的汉诺塔移动,并实现了可视化,可生成EXE程序独立于VC++环境独立运行.-A standard C Hanoi prepared visual console procedures, to achieve the development of mobile-rise Tower of Hanoi, and the realization of visualization can be generated EXE program indepe
Hanoi
- 这是用递归算法实现的汉诺塔程序。实现虽然简单，但它最大的特色就是输出形式比较美观。-This is a recursive algorithm using the Tower of Hanoi program. Although simple to achieve, but it s biggest feature is the output form of comparative aesthetics.
hanoi4
- 汉诺塔的演示！详细演示了汉诺塔的移动过程，盘子个数可以用1个到9个，建议用5个左右效果较好-Tower of Hanoi demo! Tower of Hanoi demonstrated in detail the movement of the process, the plate number can be 1-9, it is recommended to use about 5 better
hanoi
- 汉诺塔游戏，很简单的。我做的一次课程设计-Tower of Hanoi game, very simple. I do a course design
汉诺塔课设
- 实现汉诺塔的设计，适合C++新手对递归函数的理解与掌握(The design of hannotta is suitable for the understanding and mastery of the recursive function of the novice c + +)
3-汉诺塔
- 本人我用C++语言写的一个简单的汉诺塔的程序，这个程序很简单，不喜勿喷。(I have written a simple hannotta program in c ++ language, which is simple and not to be liked.)
hanoi
- 将之前做过的汉诺塔程序放在一个中，并加入图形化演示与自己移动功能用菜单选择(Will be done before the Hanoi program on a graphical presentation, and join with their mobile function with a menu selection)
java课程设计--Hannoi汉诺塔游戏
- 汉诺塔小游戏功能实现，游戏分为初，中，高难度。背景盘子颜色可以设置。(Tower of Hanoi game function, the game is divided into early, high difficulty. The color of the background plate can be set. Hannoi)
汉诺塔
- 有A,B,C三个柱子，将A柱子上的N个盘子（从大到小排列）移到C柱子上，每次只允许移动一个盘子，并且保证每个柱子上的盘子的排列都是从大到小。(There are three columns, A, B and C, which move the N plates on the A pole from the big to the small to the C pole, and only allow one plate to move each time, and ensure that the
hannuota
- 使用C++语言解决了汉诺塔问题（三柱），可以依次拓展到多柱(The use of C++ language to solve the problem of Hanoi , which in turn may be extended to multiple columns)