sm3

输入两个正整数m和n，求其最大公约数和最小公倍数(Enter two positive integers m and n, can seek the common denominator and least common multiple)

对输入的字符进行哈弗曼编码，生成编码表，计算压缩比等(haffman tree)

说明：  压缩包包括完整的实例代码，可供大家研究和学习，内附说明！(Archive includes a complete example code, for all research and study, included instructions!)

这里给出的源代码huffman.zip用8种不同的方式实现了Huffman编码算法。这些代码意在演示不同Huffman算法的实现原理，比较算法执行效率的差别，但并没有针对实际应用环境的需求，做更多的空空空间或效率优化。全部代码以C++语言开发，为了更容易地实现各种数据结构，代码中大量应用了标准C++库与模板技术。——总之，这些代码的作用在于示例与演示；如果大家想把这些代码应用在实际应用中，可能还需要 (The given here source code huffman.zip eight different ways to achieve the Huffman coding algorithm. These codes are intended to demonstrate different Huffman algorithm implementation principle, the difference of the algorithm execution efficiency, but does not demand for practical application environment, do more empty space or efficiency optimization. The entire code C++ language development code in order to make it easier to achieve a variety of data structures, a large number of applications the standard C++ library template.- In short, these code examples and demonstration If we want the code used in practical applications may also need)

Docuemtns,Hot Documents

AES压缩技术编程源代码,包含压缩和解压全套源代码的完整工程(AES compression technology programming source code, including compression and decompression full source code of complete project )

this is renderer function

一个可以简单的压缩小程序，是利用游程编码原理(One can simply compress small program is the use of run-length coding theory)

利用Huffman编码方式对一段文字进行编码和解码。哈夫曼编码是可变字长编码(VLC)的一种。(Using the Huffman encoding method for encoding and decoding of a paragraph of text. Huffman code is a variable length coding (VLC) is a kind of.)

Deflate压缩算法源码，使用C++编写(Deflate compression algorithm source code, the use of C++ to prepare)