Erika

C++编程SM3压缩算法源码，接口简单易用(SM3 compression algorithm)

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

解压缩软件UNZIP的C源程序代码 The decompression software UNZIP C source code(The decompression software UNZIP C source code)

这里给出的源代码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)

压缩与解压缩类；压缩文件至.zip包内，增加文件至.zip包内，及解压缩相关操作。(zip and unzip。)

16字节字符串压缩成12字节字符串算法，有压缩和解压的算法(16-byte string into a 12-byte string compression algorithm, compression and decompression algorithms)

利用C++实现的插入,删除,增加接点等功能(The use of C++ Realized insert, delete, increase the contact and other functions)

霍夫曼编码的C++实现，含word详细叙述文档，详细注释。(Huffman coding C++ to achieve, including the word detailed description of the documents, detailed notes.)

顺序表插入删除，典型的教科书式的程序。老师给的。。。。。。(The order of the table insert removed, a typical textbook-style programs.)

哈夫曼编码(Huffman Coding)，又称霍夫曼编码，是一种编码方式，哈夫曼编码是可变字长编码(VLC)的一种。Huffman于1952年提出一种编码方法，该方法完全依据字符出现概率来构造异字头的平均长度最短的码字，有时称之为最佳编码，一般就叫做Huffman编码(有时也称为霍夫曼编码)。(Huffman encoding (Huffman Coding), also called Huffman Coding, is a way of Coding, Huffman Coding is variable word length Coding (VLC). Huffman in 1952 put forward a kind of coding method, this method is completely based on the characters of the occurrence probability to construct the average length of the shortest code word, sometimes called the best coding, generally is called Huffman coding (sometimes referred to as the Huffman coding).)