-
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
-
ACRush_2_1
这是acm高手楼天城的比赛代码，很有用哦，对于提高算法非常有用(This is a master of building Tiancheng acm game code, very useful oh, for improving the algorithm)
- 2011-06-16 21:00:05下载
- 积分：1
-
point_to_line
计算点到直线的距离．输入两点坐标确定一个直线，再输入一个点的坐标，计算该点到直线的距离．(Calculated point to the straight line distance. Enter the coordinates of two points determine a straight line, and then input the coordinates of a point, to calculate the straight-line distance between points.)
- 2020-11-30 15:09:27下载
- 积分：1
-
quicksort
数据结构快速排序例程代码，只要按照例子就可以很容易加入到你的程序当中。(Data Structures quick sort routine code, just follow the example you can easily add them into your program.)
- 2013-05-23 15:05:53下载
- 积分：1
-
sort.cpp
各种排序的模板实现，并分析了各种实现的时间复杂度及改进办法(Templates of various sort, and analyze the time complexity of the various implementations and ways to improve)
- 2012-04-14 03:08:18下载
- 积分：1
-
NewCode
清（英文）常见数据结构，代码实现，值得下载，值得分享(Qing (English) common data structure, code implementation, worth downloading, worth sharing)
- 2012-11-21 14:33:49下载
- 积分：1
-
ALGraph
学数据结构自己总结的东西，希望对大家有所帮助。(Learn data structure sum things up, we want to help.)
- 2013-03-08 19:50:18下载
- 积分：1
-
BFS
迷宫问题 队列求解 界面还不完善 可以自己添加(Maze problem solving interface queue is not perfect you can add your own)
- 2013-12-26 22:08:58下载
- 积分：1
-
bintree
一个关于二叉树应用的小程序,包括二叉树的建立，前中后遍历等操作(a program about bintree structure)
- 2009-05-17 16:54:29下载
- 积分：1
-
jose
约瑟夫环（约瑟夫问题）是一个数学的应用问题：已知n个人（以编号1，2，3...n分别表示）围坐在一张圆桌周围。从编号为k的人开始报数，数到m的那个人出列；他的下一个人又从1开始报数，数到m的那个人又出列；依此规律重复下去，直到圆桌周围的人全部出列。通常解决这类问题时我们把编号从0~n-1，最后结果+1即为原问题的解。
(Josephus (Josephus problem) is the application of a mathematical problem: Given n individuals (with numbers 1,2,3 ... n respectively) sitting around a round table. From the number of people gettin k, number of the m man out of the line he s the next person and a number of gettin number to m the man was out of the line and so the law is repeated until the round table were all out of the column. We numbered 0 ~ n-1, the final result is the original problem solution+1 usually solve these problems.)
- 2015-01-09 17:28:41下载
- 积分：1
