-
257
几个比较好的初级算法，初学者可以看一下思想，对算法入门(A few good elementary algorithms, beginners can look at thinking on algorithms entry)
- 2013-06-16 14:38:40下载
- 积分：1
-
floy
floyd算法
数据结构
求最短路径(floyd algorithm for data structure for shortest path)
- 2007-11-13 23:39:25下载
- 积分：1
-
2.2
已知线性表中的元素以值递增有序排列，并以单链表作存储结构。试写一高效的算法，删除表中所有值大于mink且小于maxk的元素（若表中存在这样的元素）同时释放被删结点空间，并分析你的算法的时间复杂度（注意：mink和maxk是给定的两个参变量，它们的值可以和表中的元素相同，也可以不同）。(Known linear elements in the table to the value increments ordered, and a single list for the storage structure. Try to write a highly efficient algorithm to delete all values greater than mink and maxk elements smaller than (if there is such an element in the table) while the release of the deleted node space, and analyze your time complexity of the algorithm (Note: mink and maxk is given two parameters variables, their values and elements in the table can be the same or different).)
- 2015-04-11 23:11:41下载
- 积分：1
-
link
实现链表的一些操作，方便进行遍历，查找等程序(Operation, convenient linked list traversal, the search procedure)
- 2013-05-01 11:49:22下载
- 积分：1
-
Huffman-Tree
使用三叉链表实现的哈夫曼树,统计inputfile1.txt中各字符的出现频率，并据此构造Huffman树，编制Huffman 码；根据已经得到的编码，对01形式的编码段进行译码。
具体的要求：
1．将给定字符文件编码，生成编码，输出每个字符出现的次数和编码；
2．将给定编码文件译码，生成字符，输出编码及其对应字符。
(Emergence of the frequency of each character in the trigeminal lists using the Huffman tree, statistics inputfile1.txt, and accordingly the Huffman tree structure, preparation of Huffman code according to the coding has been. 01 to form the code segment for decoding.
Specific requirements:
1 coding the given character file, generating the encoding, and outputting the number and encoding of each character
2 will be given the encoding file decoding, generating the character, the output code and its corresponding character.)
- 2015-05-22 15:37:03下载
- 积分：1
-
exp2-1
数据结构（第四版）第二章上机实验题源程序答案详解(Data structure (fourth edition) chapter on lab answer questions Detailed source)
- 2014-12-31 09:14:51下载
- 积分：1
-
xiererfenchazhao
希尔排序c++数据结构算法
二分查找的递归算法(希尔排序c++数据结构算法
二分查找的递归算法
)
- 2010-12-10 18:32:52下载
- 积分：1
-
jiaotong
用于课程设计 利用Dijkstra算法进行简单的最短路径查询 (For curriculum design simple shortest path query)
- 2013-03-23 13:06:49下载
- 积分：1
-
graph-DFS
邻接表存储图，然后进行深度优先遍历及广度优先遍历。(DFS,adjacent matrix)
- 2013-10-27 20:16:41下载
- 积分：1
-
LinkNode
这个是C++编译的单链表，其中包括多种链表操作，是很好的学习资料。(This is a C++ compiler single linked list, which includes a variety of linked list operations, is a good learning materials.)
- 2012-09-24 17:22:21下载
- 积分：1
