搜索资源列表
Untitled3
- 用MATLAB动画程序描述汉诺塔游戏 效果很好-Animation program with the MATLAB descr iption of Tower of Hanoi game is very effective
hannuota
- 汉诺塔的动态演示,使用C++实现汉诺塔的动态演示-Tower of Hanoi dynamic presentation, the use of C++, dynamic presentation Tower of Hanoi
hannuotawenti
- 这是关于基本汉诺塔问题的一个算法-This is about the basic problem of a Tower of Hanoi Algorithm
猫猫
- 汉诺塔程序 C++ 最基本的汉诺塔编程 通过测试没有错误-Tower of Hanoi procedures C++ Basic programming Hanoi did not pass the test error
hanio_tower
- 汇编语言实现的层数任意可调的汉诺塔演示程序-Assembly language to achieve arbitrary adjustable-rise Tower of Hanoi demo program
DrawPanel
- 一个有关于汉诺塔游戏的源代码，很有用的，希望能够对你们有用。-Tower of Hanoi on a game
MainFrame
- 也是用java编写的代码，是有关汉诺塔实现的主类代码，-Is also prepared to use java code, is the Tower of Hanoi to achieve the main types of code,
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.
han
- 汉诺塔，解决和尚搬运问题。包括了图形实现函数-Tower of Hanoi, to solve transportation problems monk. Including the graphical realization of function
123
- 用ActiveX实现的汉诺塔游戏?肁ctiveX实现的汉诺塔游戏用ActiveX实现的汉诺塔游戏-ActiveX achieved by Tower of Hanoi game?肁ctiveX achieved using ActiveX game Tower of Hanoi Tower of Hanoi game is to achieve
hannuota
- 汉诺塔游戏源代码，汉诺塔游戏是把塔1上的碟子移动到塔2上去，其间借助于塔3的帮助。每次只能移动一个碟子，另外，任何时候都不能把一个碟子放在比它小的碟子上面。-Tower of Hanoi game source code, the game is the Tower of Hanoi Tower 1 on the plate 2 to move to the tower go up, which means the help of Tower 3. Each can only move one
hannuo
- Java版本的汉诺塔的求解，完整的netbeans项目-Java version of the Tower of Hanoi Solution, a complete NetBeans project
hannuo
- 数据结构中经典的汉诺塔算法。就是用递归移动盘子的问题。-Data structure in the classic Tower of Hanoi algorithm. Is to use recursive mobile plate problem.
hannuota
- 简单的汉诺塔游戏，双击可执行文件便可运行，点‘开始’开始游戏-Tower of Hanoi game is simple, double-click the executable file can be run at the beginning of the beginning of the game
ChineseTa
- 解决汉诺塔移动的问题，问题的提出：传说婆罗门庙里有一个塔台，台上有3根标号为A,B,C的用钻石做成的柱子，在A柱子上放着64个金盘，每一个都比下面的略小一些。把A柱子上的金盘子全部移到C柱上的那一天就是世界末日。移到的条件是：一次只能移到一个金盘，移到过程中大金盘不能放在小金盘上面。庙里的僧人一直在移个不停。因为全部的移动是264－1次，如果每秒移动一次的话需要500亿年-Tower of Hanoi to resolve the issue of moving, the problem: On
hanluota
- 汉诺塔问题的求解，数据结构实验时做得，希望有用。-Tower of Hanoi problem solving, data structure experiments done, I hope useful.
Han_nuota
- 汉诺塔小程序的源代码 输入盘中个数后，给出移动步骤-Tower of Hanoi applet source code after the number of input, the given mobile steps
erwr
- 数据结构\动画演示，包括汉诺塔等程序，上课给的-Animation data structure, including the Tower of Hanoi, such as procedures, classes given by
hannuota
- 可以创建一个汉诺塔的小程序，输入数字即可-Tower of Hanoi, you can create a small program, enter the number you
C1
- 将一个磁盘文件的信息复制到另一个磁盘文件中.编写一个输出链表的print.用选择法对10个整数按从大到小排列.汉诺塔算法的递归实现C源代码.（输出数组中的全部元素-A disk file copy to another disk file. To prepare a list of the output print. With selection of 10 by the smallest integer array. Recursive Tower of Hanoi algorithm rea