-
Phone-book
数据结构课程设计 -电话本(运用了MFC图形化界面)(Curriculum design- the phone book)
- 2015-03-09 22:04:07下载
- 积分:1
-
min-dist
图中计算最短路径,必须覆盖所有的节点,效率很高(to compute the shortest path in the graph)
- 2012-01-06 00:03:33下载
- 积分:1
-
algorithm
一本介绍各种算法的经典书籍,计算机算法设计与分析(A classic book introduces a variety of algorithms, algorithm design and analysis of computer)
- 2011-08-08 22:13:02下载
- 积分:1
-
heapsort
说明: 从最后一个非叶子结点开始从后往前进行调整,保证了根下的所有子树都是最大堆,最后对根进行调整,使整棵二叉树为最大堆,保证了根结点为整棵数的最大值点,完成了建堆的过程,再将根结点跟最后一个结点进行交换,如此反复操作,则堆排序就完成了,其中堆排序的过程采用了满二叉树的概念。(From the final of a non-leaf node after the move began to be adjusted to ensure that the root of all sub-tree are the biggest pile, and finally adjusted to the root, so that the largest heap binary tree整棵to ensure that the root node for整棵the maximum number of points, completed the process of building reactors, and then the last root node with a node to be exchanged, and so repeated the operation, then HEAPSORT completed, of which the process of HEAPSORT a full binary tree concept.)
- 2008-11-11 22:53:42下载
- 积分:1
-
xiererfenchazhao
希尔排序c++数据结构算法
二分查找的递归算法(希尔排序c++数据结构算法
二分查找的递归算法
)
- 2010-12-10 18:32:52下载
- 积分:1
-
1_1
最小生成树算法 克鲁斯法尔算法 球最佳路径(kulru method class maiun void cx )
- 2009-09-13 22:45:01下载
- 积分:1
-
tree
二叉树的先序遍历。采用递归实现。释放资源时用了后序遍历。(Preorder traversal of a binary tree. Recursive implementation. Release resources used after preorder.)
- 2013-07-09 13:39:31下载
- 积分:1
-
hanoi
实现汉诺塔的操作步骤输出,可以设置1,2,3三个塔柱,输出结果为用1,2,3表示的操作(Tower of Hanoi the steps to achieve the output, you can set 1,2,3 3 Pylon, the output result of the operation that used 1,2,3)
- 2009-12-05 22:11:52下载
- 积分:1
-
tree
二叉树的先序遍历。采用递归实现。释放资源时用了后序遍历。(Preorder traversal of a binary tree. Recursive implementation. Release resources used after preorder.)
- 2013-07-09 13:39:31下载
- 积分:1
-
heapSort.cpp.tar
这是一个堆排序的算法源程序,算法被单独写成一个函数,希望对大家有用(This is a heap sort algorithm source code, algorithms are written as a separate function, we hope to be useful)
- 2013-12-12 14:52:48下载
- 积分:1