搜索资源列表
xuejiguanlixitong
- JAVA程序设计\\《Java课程设计》很不错的综合实验.为学生管理系统塔-JAVA programming \\ "Java curriculum design" very good comprehensive experiment. Management System for students tower
9313644-1
- The C# program will solve the Tower of Hanoi for a given number of rings/disks/plates and display the ring/disk/plate movement. The movement will be shown graphically-The C# program will solve the Tower of Hanoi for a given number of rings / disks /
JAVA_leidian
- JAVA版雷电源码,边看原代码，边玩游戏。 运行方法： C:\\tower>java lightning.Game -Raiden source Java, watched the original code, while playing the game. Running : C : \\ tower
motazhe
- 阿尔卡特 ot556/ot557 以上机型可以玩的 java游戏 魔塔者无敌 比较好玩哦 可以全屏可以存挡-Alcatel ot556/ot557 above models can play the devil tower java games were more invincible oh fun full screen can block deposit
Hanoi塔java源程序
- Hanoi塔java源程序 一个经典的递归程序，在java上的实现。-Hanoi tower java source a classic recursive procedure, in the realization of java.
fanta
- 梵塔问题的递归求解-Vatican Tower of recursive solution
tower
- 用途星座的汉诺塔程序， 很好玩-use the constellation HANOR procedures, is a lot of fun
sadfd
- 汉诺塔设计，希望对大家有用，请大家多多指教。-Hanoi Tower design, we hope to useful, please exhibitions.
hano2006916
- 这个程序是对汉诺塔的直观演示,可以通过键盘的方向键来控制塔子的移动和确定,在c环境下编译无误,很不错的!-this procedure is to HANOR visual demonstration through the keyboard keys to the control tower-Mobile and decided that the environment c compiler correct, very good!
HannoiTowerDemo
- JAVA编的汉诺塔，有自动演示哦，希望大家多给建议：）-JAVA addendum to the Tower of Hanoi, automatic demo Oh, I hope that Members will give recommendations :)
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 algorithm implementation rate f
nuohantahuatuban
- 好玩的汗诺塔,是以画图的形式,清晰好玩!各位同僚不仿试试!-fun Khan Tower is drawing in the form of clear fun! Not fake my colleagues to try!
ruheyidongpanzi
- 一个基于 c++的汉罗塔模拟源码,他可以选择移动几个塔,也可以选择是否需要终止64位塔的模拟过程-a c-based simulation of the Han Rota source, he could choose several mobile tower can also choose whether or not to terminate 64 tower simulation
hanio1
- 四柱汉诺塔问题的求解程序.解题思路:如a,b,c,d四柱. 要把a柱第n个盘移到目标柱子(d柱),先把上层 分两为两部份,上半部份移到b柱,下半部分移到c柱,再把第n盘移到 目标柱子,然后,c柱盘子再移到目标柱子,再把b柱盘子移到目标柱子. 细节地方: 上半部份移到b柱时,它的中间变量柱子是有二选一的.而下半部分 移到c柱时,它的中间变量柱子只有一个(因为一个柱子已被上半部份 占了).b,c也移到目标柱子时同理。-4-Tower of the solution pro
sf_20041019211948
- C语言编写埃菲尔铁塔，C语言编写埃菲尔铁塔 C语言编写埃菲尔铁塔-C language Eiffel Tower. C language Eiffel Tower C language C language Eiffel Tower Eiffel Tower
tower001
- 大名鼎鼎的河內塔！！可自由選擇柱數與環數，並告知使用者移動過程。-the famous Hanoi tower! ! Freedom of choice - with a few rings and inform users of mobile process.
motarpg
- RPG冒险游戏，操纵主角到塔的最上层９出公主消灭恶魔．为Ｅclipse工程文件．源码完整-RPG adventure game, manipulation of stars to the tower top nine Princess destroy the devil. Eclipse works for the paper. Source integrity
hanopreviewi
- Hanoi塔演示。 这是c语言中的一个著名程序演示。 看看对你一定有帮助-Hanoi Tower. C This is a language of the famous demonstration procedures. You must look at the right help
newhanoi
- 一个经典的智力游戏，汉诺塔！希望对初学者有帮助-a classic intellectual games, Hanoi Tower! Hope to help beginners
Hanogkhk
- 用递规子程序的方法实现HANOI塔问题.子程序模块个数不限. 要求: 盘子个数可以输入,第一个塔为A,第二个塔为B,第三个塔 的名称为C.打印出移动过程. -regulation subroutine with the delivery method HANOI Tower. Open-number subroutine modules. Requirements : Number plate can be imported, a Tower A, the second tower