-
hannuota
分析汉诺塔,选择合适方法编程实现汉诺塔问题的解答。(Analysis of the Tower of Hanoi, select the appropriate method of programming the answers of the Tower of Hanoi problem.)
- 2012-05-22 18:48:33下载
- 积分:1
-
SplitADT
链表L,创建公有成员函数Split(A,B ),创建2个新表A,B,使的A 中含有L中奇数位置元数,B中含L偶数位置元数
(Chain L, create public member function Split (A, B), to create two new tables A, B, A so containing L odd position of a few yuan, B-L even a few locations yuan)
- 2007-03-30 20:48:18下载
- 积分:1
-
Birch
这是birch C语言的源代码。里面有详细的代码注释方便学习birch算法(birch c)
- 2012-05-08 09:00:44下载
- 积分:1
-
stack
数据结构 堆栈 实现了以下功能:
cout<<"----------------主菜单---------------"<<endl
<<"* 1.建立 *"<<endl
<<"* 2.输出 *"<<endl
<<"* 3.判断栈是否为空 *"<<endl
<<"* 4.栈的长度 *"<<endl
<<"* 5.输出栈顶元素 *"<<endl
<<"* 6.进栈 *"<<endl
<<"* 7.出栈 *"<<endl
<<"* 8.遍历 *"<<endl
<<"* 9.数制转换 *"<<endl
<<"* 10.清空 *"<<endl
<<"* 11.销毁 *"<<endl
<<"* 12.退出 *"<<endl
<<"--------------------------------------"<<endl<<endl (data structure stack)
- 2013-11-01 11:05:10下载
- 积分:1
-
exchange
这是一个二叉树左右子树交换的简单程序,希望对大家有用!(This is a binary tree so the simple sub-tree exchange procedures in the hope for all of us!)
- 2009-10-16 21:02:19下载
- 积分:1
-
9
说明: 任意给定输入的一个小写英文字符串a1a2a3…an-1an (n≥5)
输出:字符串Ana1An-1a2An-2a3…A2an-1A1an,其中Ai为ai的大写形式
例如,输入aybdx,则递归程序输出XaDyBbYdAx
(Any given input of a lowercase string a1a2a3 ... an-1an (n ≥ 5) Output: the string Ana1An-1a2An-2a3 A2an-1A1an, which Ai ai uppercase for example, input aybdx recursive program output XaDyBbYdAx)
- 2012-05-30 10:59:39下载
- 积分:1
-
host2
说明: 马踏棋盘算法编程,实现在棋盘上任意两点间的最短路径求解。(horse riding chessboard programming algorithm to achieve on the chessboard arbitrary 2:00 of finding the shortest path.)
- 2006-04-30 00:12:21下载
- 积分:1
-
algorithm
一本介绍各种算法的经典书籍,计算机算法设计与分析(A classic book introduces a variety of algorithms, algorithm design and analysis of computer)
- 2011-08-08 22:13:02下载
- 积分:1
-
maze
实现经典问题老鼠迷宫,并用坐标将路径显示出来(Achieve classic problem rat maze, and coordinate with the path displayed)
- 2016-05-25 22:56:59下载
- 积分:1
-
tree
求二叉树的深度:
给定一个有根二叉树,规定连接两个节点的每条边长度是1,定义树的深度为根到叶子节点距离的最大值。 (Description
给定一个有根二叉树,规定连接两个节点的每条边长度是1,定义树的深度为根到叶子节点距离的最大值。 )
- 2011-12-11 20:42:18下载
- 积分:1