-
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
-
floy
floyd算法
数据结构
求最短路径(floyd algorithm for data structure for shortest path)
- 2007-11-13 23:39:25下载
- 积分：1
-
library
纯C语言编程的模拟现有图书馆的借阅、续借、归还；图书入库、出库；查询、排序等功能，实现电子图书馆的智慧综合管理。其中查询功能里面嵌套精确查询，排序功能有六种，界面可变色，里面已经附带50多本图书信息包括图书摘要等详细信息。里面还附带详细设计报告和解说PPt。(Pure C language programming simulation existing library borrow, renew, return book storage, a library queries, sorting and other functions, to achieve integrated management of electronic library wisdom. Precisely where the query function inside a nested query, sort function has six, the interface can change color, which has included more than 50 books including books summary information and other details. Which also included detailed design reports and commentary PPt.)
- 2020-10-30 14:59:57下载
- 积分：1
-
xiaobaishu
参加数学建模的同学很可能会遇到这套题。本程序采用链表进行编写，很方便地解决了小白鼠问题。(Mathematical modeling of the students participating are likely to encounter this question, the program uses the list to solve the problem of mice, very convenient.)
- 2013-08-29 16:09:43下载
- 积分：1
-
FinalExam
C语言期末考试题，含答案。数组、链表、函数等的使用和C编程。(failed to translate)
- 2011-11-07 20:07:25下载
- 积分：1
-
DIJKSTRA算法实现的最短路径程序linjiebiaoshortpath
用邻接表表示的数据结构，及DIJKSTRA算法实现的最短路径程序(adjoining table with the data structure and algorithm DIJKSTRA the shortest path procedures)
- 2020-07-16 10:48:49下载
- 积分：1
-
xuanzexingjiegou
选择型结构c语言编程 (Choose the type of structure of C language programming)
- 2013-09-24 22:11:37下载
- 积分：1
-
the-dynamic-planning
本文讨论了动态规划这一思想的核心内容和其基本特点，探讨了动态规划思想的适用范围，动态规划子问题空间和递推关系式确立的一般思路。(This paper discusses the dynamic planning this thought core content and its basic characteristics, this paper discusses the dynamic planning idea, the applicable scope of the dynamic programming problem space and son recursive formula of the establishment of general thoughts.
)
- 2011-12-15 16:49:05下载
- 积分：1
-
CatchData
说明： 读取股票数据文件,C++源程序，非常好用。是学生做毕业设计的源料(Read the Stock Data File)
- 2010-03-22 20:19:35下载
- 积分：1
-
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
