-
multiplication
本程序是用c语言编写的在800位整数之间的乘积运算(This procedure is written in c the 800 integers in the product operation between)
- 2009-05-16 22:04:42下载
- 积分：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
-
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
-
pinfanfangwen
设有一头指针为L的带有表头结点的非循环双向链表，其每个结点中除有prev（前驱指针），data（数据）和next（后继指针）域外，还有一个访问频度域freq。在链表被起用前，其值均初始化为零。每当在链表中进行一次Locate(L,x)运算时，令元素值为x的结点中freq域的值增1，并使此链表中结点保持按访问频度非增（递减）的顺序排列，同时最近访问的结点排在频度相同的结点的最后，以便使频繁访问的结点总是靠近表头。试编写符合上述要求的Locate(L,x)运算的算法，该运算为函数过程，返回找到结点的地址，类型为指针型。(Has a head pointer is non-circular doubly linked list L with a header node, each node in addition to prev (precursor pointer), data (data) and next (successor pointers) outside, there is an access frequency degree domain freq. Before the list was hired, their values are initialized to zero. Whenever carried out in the list once Locate (L, x) when the operation, so that the element node x is the value in freq domain by one, and keep this list in the node-access frequency of non-increasing (decreasing) the order, while a recent visit to the nodes in the same row of the frequency of the last node, so that the nodes are frequently accessed tables are always near the head. Locate (L, x) algorithm is prepared in accordance with the above requirements of the test operation, the operation as a function of the process, return to find the address of the node of type pointer.)
- 2015-01-15 22:31:59下载
- 积分：1
-
a-linked-list-and-related-processing
链表的建立及相关处理，包括排序，删除，初始化，增加，删除等等，且程序已运行通过。(The establishment of a linked list and related processing, including sorting, delete, initialization, increase, delete, etc., and the program has been run through
)
- 2014-01-13 23:56:27下载
- 积分：1
-
yuesefu
数据结构经典算法 约瑟夫问题 c++ 已经测试通过(josephus c++)
- 2012-12-02 16:23:02下载
- 积分：1
-
Test6
最短路径算法。
用无向带全图的邻接矩阵存储图，确定从源点出发到其它各点的最短路径。
输入：图中包含的顶点数n 边数m， 各边权值，用邻接矩阵或者邻接表存储。
输出：源点到其它各点的最短路径值。(Shortest path algorithm. Adjacency matrix storage with undirected graph with a full figure, determine the starting point of the shortest path from the source point of each other. Input: Vertices figure included n the number of edges m, the weight of each side, with the adjacency matrix or adjacency table storage. Output: source shortest path to value each other points.)
- 2014-05-11 17:05:37下载
- 积分：1
-
04huffman_a
根据最常用的链表法进行huffman编码，可以手工预制权重，例如n=8的时候即可以在文件中写入，输出相应的编码结果(According to the most commonly used method of Chain Huffman coding, manual can be prefabricated weight, For example, n = 8 when it is written in the document, the output corresponding to the coding results)
- 2007-05-29 19:15:26下载
- 积分：1
-
Set
使用C语言建立带头结点链表实现了集合。并进行了性能上的优化。(Achieve set using C to build list witch head node. And make optimization in performance.)
- 2009-11-18 13:29:05下载
- 积分：1
-
shell
希尔排序，希尔排序，希尔排序，希尔排序，c语言(shell sort)
- 2010-10-30 10:39:13下载
- 积分：1
