-
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
-
tanxinfangfa
说明： 贪心方法是一种改进了的分级处理方法。它首先根据题意，选取一种量度标准。然后按这种量度标准对这n个输入排序，并按排序一次输入一个量。如果这个输入和当前已构成在这种量度意义下的部分最优解加在一起不能产生一个可行解，则不把此解输入加到这部分解中。这种能够得到某种度量意义下的最优解的分级处理方法称为贪心方法。(greedy method is an improvement of the classification methods. According to its first title Italy, and a selection of standards of measurement. Then, under such a standard measure of this sort n input, with an input an order volume. If the input current and constitutes a measure of significance in this part of the optimal solution together not produce a feasible solution. this solution will not put this added to the importation of decomposition. This can be a meaningful measure of the optimal solution hierarchical method, known as greedy method.)
- 2006-05-15 21:50:01下载
- 积分：1
-
build_max_heap
最大堆排序算法，C++语言编写,原程序，算法导论(The maximum heap sort algorithm, C++ language)
- 2015-01-26 16:15:21下载
- 积分：1
-
huffman_tree
数据结构学习中提供的不错的源码，一个哈夫曼树类，利用了链队列存储结构。压缩包中有七个文件。(Data structure provided a good learning source, a Huffman tree class, the use of the chain queue storage structure. There are seven compressed file.)
- 2013-12-28 15:21:48下载
- 积分：1
-
FreeTree
无环连通图G=(V, E)亦称为自由树T，其直径是树中所有顶点之间最短路径的最大值，设计一个算法求T的直径(Acyclic connected graph G = (V, E) is also known as free tree T, whose diameter is the tree of shortest paths between all vertices maximum design an algorithm for the diameter of T)
- 2013-10-29 16:31:47下载
- 积分：1
-
1_19
顺序查找和时间 清华大学出版社 《数据结构 c++》 (search in order)
- 2011-02-05 21:56:14下载
- 积分：1
-
lab07
本例主要设计查找的有关算法，例如有序表的查找和顺序标的查找，顺序查找、折半查找及二叉排序树上查找的基本思想和算法实现等。(In this case mainly designed to find the relevant algorithm, such as an ordered list of the find and order the subject to find, sequential search, binary search and binary sort tree to find the basic idea and algorithm.)
- 2013-05-12 22:01:58下载
- 积分：1
-
exp2-1
数据结构（第四版）第二章上机实验题源程序答案详解(Data structure (fourth edition) chapter on lab answer questions Detailed source)
- 2014-12-31 09:14:51下载
- 积分：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
-
Subset
说明： 子集和数问题.rar，用C++写的，可以运行(Subset of several problems. Rar, written in C++, you can run)
- 2010-04-16 17:42:12下载
- 积分：1
