RC500 DEMO upper plate collection of various data compression package.

关于异常的一些算法；都是很金典的例子，大家去看看吧。-On the unusual number of algorithm are very Jindian example, go and see everyone.

数据压缩源代码和VC中使用DEMO，能够压缩内存数据。- Data compression source code and a demo by VC that can compress data in memory.

该程序用ＶＣ实现了一个小型文件压缩与解压缩功能的程序，系统中使用静态二叉树，哈希表等数据结构，采用哈夫曼编码进行压缩与解压缩．-VC realize the program with a small file compression and decompression functions, systems use the static binary tree, hash table, such as data structure, the use of Huffman coding for compression and decompression.

As of UnZip 5.42, this source has been removed from Info-ZIP s UnZip source distribution because of its conflicting copyright. There are no plans to ever rewrite this code from scratch, because the unreduce algorithm was never used in the "real" world. -As of UnZip 5.42. this source has been removed from Info- ZIP"s UnZ ip source distribution because of its conflict ing copyright. There are no plans to ever rewrit e this code from scratch, unreduce because the algorithm was never used i n the "real" world.

数据库 是 用 jsp 语言 所编写-database was prepared by the language jsp

tcp文本传输，客户端，服务器端，简单实现！-tcp HTTP, client, server-side, simple to achieve!

数据压缩的方法演示-data compression method demonstration

Huffman编解码器的模拟实现 应用Huffman算法实现模拟编解码器，程序实现对输入的一篇英文文章(以 .txt文件读入)，输出Huffman 码流(以 .txt文件输出)，最好能实现译码过程。程序语言可以选用C、 VC或C++。-Huffman CODECs the simulation application Huffman algorithm simulation codecs, Programming on the importation of an article in English (. txt file income), Huffman code stream output (. txt files output), it would be desirable to achieve decoding process. The choice of programming language C, or C VC.

ajax+jsp打造的Blog源码,运行环境：eclipse+tomcat5.5-ajax+ jsp to create the Blog-source, operating environment: eclipse+ tomcat5.5

地图着色把地图上的每个城市抽象为一个点，并给每个城市编号，，相邻的城市之间用直线连接。据此做出邻接矩阵，若第i个城市与第j个城市相邻，则metro[i][j]=1,否则metro[i][j]=0。 算法：按照编号从小到大的顺序检查每个城市，对每个城市从1到4使用4种颜色着色，若当前颜色可用（即不与相邻城市颜色相同），则着色；否则测试下一种颜色。 -Map coloring to each city on the map as a point of abstraction, and to every city number, adjacent lines to connect between cities. Accordingly to make adjacency matrix, if the section i and section j cities adjacent cities, the metro [i] [j] = 1, otherwise the metro [i] [j] = 0. Algorithm: In accordance with the code sequence from small to large checks every city, every city on 1-4 from the use of four kinds of color shading, color can be used if the current (ie not with the same colors as the neighboring cities), then coloring Otherwise, the next test colors.