sm3

Huffman编码，使用哈弗曼树生成前缀码，把输入的字符编码并把原字符解码(Huffman code and decode)

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

newmark-b法的简要程序，供大家使用(newmark-b)

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

这是一个基于LZARI算法的数据压缩的类.Haruhiko Okumura 于1989年7月4日用C语言写实现了这个算法.但是上面用到了一些全局或静态的变量,在MFC下用起来很不方便.作者把它改写成了一个C++类,使它可以方便的压缩和解压缩。(LZARI algorithm based on the type of data compression. Haruhiko SAP in 1989, July 4 C language daily wrote realization of this algorithm. But above uses some static or global variables, using the MFC which are very convenient. Authors rewrite it became a category C, it can be to facilitate the compression.)

简单易用的制作压缩包软件，原著老毛桃。使用简单，压缩时间快(easy to use for make cab)

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

用C++的模板类实现的霍夫曼树及其编码过程，可视地展示霍夫曼树的结构。(Huffman tree and its encoding process to achieve C++ template class, visual display of the structure of the Huffman tree.)

香农编码的C++实现。原理说明以及源代码。(The Shannon coding C++. Principle of instructions and source code.)

哈夫曼编码，基于MFC开发。哈夫曼编码为熵编码中的最佳方法之一，广泛用于各种数据压缩技术中。-Huffman coding, based on the MFC. Huffman coding for entropy coding one of the best ways, for a wide variety of data compression technology.