qiongju

数据结构的稀疏矩阵的几部分操作，广工的课程设计(Sparse matrix operations)

使用VC编写的约瑟夫环程序，简单明了，方便使用(Prepared using the VC Joseph Central program, simple and clear, easy to use)

哈夫曼树可以使读者快速方便的查找所需文件(Huffman tree allows readers to quickly and easily find the file)

链表的模板类,提供插入删除，遍历器，查找等功能，只有一个头文件，可以包含到你的工程(template implemention of Chain)

根据最常用的链表法进行huffman编码，可以手工预制权重，例如n=8的时候即可以在文件中写入，输出相应的编码结果(According to the most commonly used method of Chain Huffman coding, manual can be prefabricated weight, For example, n = 8 when it is written in the document, the output corresponding to the coding results)

计算点到直线的距离．输入两点坐标确定一个直线，再输入一个点的坐标，计算该点到直线的距离．(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.)

这是birch C语言的源代码。里面有详细的代码注释方便学习birch算法(birch c)

字符串，实现了文件中查找想要的字符串，并将其标记出来

约瑟夫环的循环链表实现，这个程序比较完整，有需要做试验的请速速下载。(Josephus cycle Chain achieved, the procedure is complete, the pilot needs to be done urgently requested to download.)

some problems about c++.(car.cpp)