搜索资源列表
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塔java源程序
- Hanoi塔java源程序 一个经典的递归程序，在java上的实现。-Hanoi tower java source a classic recursive procedure, in the realization of java.
HanoiStack
- 建立抽象基类栈Stack及其派生类顺序栈，然后利用栈实现汉诺塔问题的非递归算法。-Non-recursive algorithm of Hanoi Tower using Stack
2001374424
- 用汇编编写的河内塔程序 将第一柱a上n-1个盘借助第二柱c移到第三柱b 把a上剩下的一个盘移到c 将n-1个盘从b借助a移到第三柱c 这三步是图示河内塔的根本方法 功能一：自己动手移动河内塔 先按左右键选择要移的盘，按箭头上键确定 再按左右键移到要的盘 如此，再根据河内塔的规则确定较好的次数step2 功能二：图示河内塔移动过程 根据河内塔的基本方法，确定图象，按任意键选下一步，（开始时输入level）- A n-1 plate transfers to with the assembly co
myprojects
- 哥德巴赫猜想,哈夫曼编码译码器,河内塔问题等的VC++解决，许多算法的实现-Goldbach Conjecture, Huffman decoder, Hanoi tower problem, etc. VC++ Resolved, the realization of many algorithms
bangzhuxinxi
- 这个源代码是我多年珍藏的，现在拿出来跟大家分享，是汉诺塔的帮助信息类，-This source code is a collection of my many years, and now share with you out is the help of Hanoi Tower of information categories,
hanuota
- 使用visual c++ 语言设计实现汉诺塔问题，再加上opengl语言工具，具体的逼真再现动态的汉诺塔-The use of visual c++ Language Design and Implementation of Hanoi Tower problem, coupled with opengl language tool, the specific dynamics of realistic reproduction of Hanoi Tower
hannuota
- EXCEL编写的汉诺塔实例...感觉应该可以让人直观明了.~-EXCEL prepared examples of Hanoi Tower ... feel people should be able to understand intuitively. ~
TowersOfHanoi
- 汉诺塔！！！ Simulate the movement of the Towers of Hanoi puzzle Bonus is possible for using animation eg. if n = 2 A→B A→C B→C if n = 3 A→C A→B C→B A→C B→A B→C A→C -Hanoi Tower! ! ! Simulate the movement of the Towers of Hanoi puzzle Bonus is pos
hanoi
- 一个关于汉诺仪塔的算法，能够显示出具体的每个盘的移动步骤，还有经过了多少步骤的次数。-Hannuoba instrument on the tower algorithm, be able to show that each specific set of mobile steps to have the number after the number of steps.
hannoi
- 汉诺塔的小程序，本程序使用递归调用实现。-Hanoi Tower of small procedures, the procedures for the realization of the use of recursive calls.
Hannoi
- 用JAVA编写实现汉诺塔游戏，玩法我想大家都应该知道-Prepared with the realization of Hanoi Tower JAVA games, play I think we should all know
hanluota
- 这是在C语言环境下实现汉诺塔自动移动的程序(This is the tower of Hanoi mobile program in C language environment)
data structure
- 求汉诺塔的递归算法 复杂度o（2^n-1）(A recursive algorithm for solving the tower of Hanoi)
汉诺塔
- 一个关于汉诺塔小算法，可以通过这个算法解决汉诺塔。(A tower of Hanoi algorithm, this algorithm can be solved by Hanoi .)
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)
ShowHanoi
- 设置层数即可可视化地展示汉诺塔的移动过程。可直接导入工程到各种IDE(如Eclipse中)，十分便捷。(Virtually Show the process of the moving of Hanoi Tower. You can directly import the project into Eclipse.)
汉罗塔
- 汉诺塔的图解递归算法。汉诺塔（又称河内塔）问题是源于印度一个古老传说的益智玩具。大梵天创造世界的时候做了三根金刚石柱子，在一根柱子上从下往上按照大小顺序摞着64片黄金圆盘。大梵天命令婆罗门把圆盘从下面开始按大小顺序重新摆放在另一根柱子上。并且规定，在小圆盘上不能放大圆盘，在三根柱子之间一次只能移动一个圆盘。(Diagram of the tower of Hanoi recursive algorithm)
汉诺塔
- C++实现的汉诺塔小游戏 汉诺塔：汉诺塔（又称河内塔）问题是源于印度一个古老传说的益智玩具。大梵天创造世界的时候做了三根金刚石柱子，在一根柱子上从下往上按照大小顺序摞着64片黄金圆盘。大梵天命令婆罗门把圆盘从下面开始按大小顺序重新摆放在另一根柱子上。并且规定，在小圆盘上不能放大圆盘，在三根柱子之间一次只能移动一个圆盘。(C++ implementation of the tower of Hanoi game Hanoi Hanoi: (also known as the tower of
Hanoi Tower
- 基于visual studio平台，使用c#开发语言，用类的方式编写的汉诺塔游戏。(Based on Visual studio platform, using the c# language, written in class way of Hanoi game.)