-
KMP
说明： KMP算法的具体实现，能够在O(n+m)时间内找出字串在父串中的位置，n为父串长度，m为字串长度(KMP in the proposed algorithm, can be O (n+ m) time to find the string in the parent string position, n the parent string length, m for the string length)
- 2010-04-28 16:18:00下载
- 积分：1
-
HuffanCoding
读取数据，统计所得到的文件中每个字母的权值，创建哈夫曼树，哈夫曼编码。哈夫曼解码，解码后内容写入到指定的文件。
读取数据里面的内容是由英文单词组成。读取文件的时候传入文件存放的路径、读取方式以及读出以后存放的数组，最终可以得到一个存放目标文件内容的数组。
将得到的数组进行字母权值的统计，统计每个字母出现的次数，次数即为每个字母的权值。
将得到的字符数组与权值数组作为创建哈夫曼树的依据，哈夫曼树根据每个字母权值的大小来创建，每个节点，包括权值、父节点、左子、右子和字母本身。
根据哈夫曼树进行编码。形成目标文件的哈夫曼编码，将此编码返回。
根据哈夫曼树得到的数组即为解码数组，解码数组作为解码的结果返回。
写入输出文件，将解码得到的数组、文件的完整路径以及文件的写方式作为参数传入，将数组写入到相应的文件中。
(Read the data, statistical documents obtained weights for each letter, create a Huffman tree, Huffman coding. Huffman decoding, the decoded contents are written to the specified file.
Read the content inside is composed of English words. When the incoming file to read the file storage path, read mode and read out after storage array that can eventually get a storage target file contents of the array.
The resulting array of letter weights statistics, statistical number of occurrences of each letter, the number is the weight of each letter.
The resulting character array with the weights array as the basis for creating Huffman tree, Huffman tree based on the size of the weights of each letter to create, for each node, including weights, parent, left child, right child, and letter itself.
According to Huffman coding. The formation of the target file Huffman coding, this code returns.
According to Huffman decoding the resulting array is an array, the decoder decodes the result is retur)
- 2020-07-02 15:40:01下载
- 积分：1
-
polynomial
本程序实现一元多项式合并。本程序输入方式为按项输入，每输入一个项，会先提示输入项的幂，再提示输入项的系数。(This procedure combined to achieve a dollar polynomial. This procedure according to entry input methods for the input, one for each input item, it will first prompt entry of the power, and then prompts entry of the coefficient.)
- 2009-12-16 17:29:54下载
- 积分：1
-
length
利用佛洛伊德算法计算节点之间的最短路径,用于复杂网络中计算平均路径长度(average path lengh)
- 2011-09-01 11:13:51下载
- 积分：1
-
5100309203_5_8
二叉树类的前序，后序，层次遍历，其以链表方式存储(Binary tree class pre-order, post-order, hierarchy traversal, the linked list storage)
- 2012-12-16 14:16:41下载
- 积分：1
-
GraphTheory
讲述数据机构的图论部分和程序设计的关系，适合学习算法的同学学习阅读，很不错的一本书。(Graph theory algorithm and programming)
- 2013-12-04 20:12:39下载
- 积分：1
-
Six-degree-space
中国大学MOOC-陈越、何钦铭-数据结构
解题报告—06-3 六度空间 (Chinese University MOOC- Chen Yue, He Qinming- data structure
Solving report of the problem- 06-3 Six degrees space)
- 2015-09-06 11:09:27下载
- 积分：1
-
Huffman
哈夫曼树可以使读者快速方便的查找所需文件(Huffman tree allows readers to quickly and easily find the file)
- 2010-06-09 13:09:47下载
- 积分：1
-
ALGO3-9
用于迷宫问题的解决用户根据根据要求进行设置即可在屏幕上显示(Maze problems for users in accordance with the requirements set can be displayed on the screen)
- 2008-07-02 02:41:08下载
- 积分：1
-
maopao_youhua
冒泡优化：
如果一个序列是int n[]={1,2,3,4,5,6,7,8,9} , 用正常的冒泡排序需要排8次才行，优化之后1次就好，也就是说序列越接近于正常序列，改进之后的冒泡排序的次数就越少，这样会给一个冒泡排序算法带了很大的效率。
思想：添加一个boolean变量用来判断冒泡是否是已经排好了顺序，如果boolean的值为false，说明是已经排好了，如果boolean的值true，说明没有排好，继续排。(If a sequence is int n [] = {, 1,2,3,4,5,6,7,8,9} need to row 8 times the job after optimization times like normal bubble sort, but alsomeans that the sequence is more close to the normal sequence, improved bubble sort, the less the number, which would give a bubble sort algorithm with a great deal of efficiency.
Idea: add a boolean variable used to determine the bubble whether it is already lined up the order, if the boolean is false, indicating already lined up, if the boolean value of true, did not line up, continue to row.)
- 2012-04-18 00:33:45下载
- 积分：1
