稀疏矩阵的基本运算。

一个不错的员工培训系统-a good staff training system

基本的冒泡算法，可供数据结构的初学者参考，希望能有所帮助。-sort

编写我们自己的miniSQL代码，几周前没有调试

矩阵常见算法，C++实现的类，这是个下载的公用类如果侵犯了您的权利，请告诉我。-This class implements some usual operation about matrix.If this pragram being put on the internet infringe upon your right,please tell me.

数据结构 链表 按顺序合并两链表。 pa =1 2 4 7 9 11 16 pb= 1 6 9 23 24 36 1 1 2 4 6 7 9 11 16 23 24 36-link

伸展树……我写的很难看，而且又很长，这个结构唯一有用的就是可以分离树- Extends the tree... ... I write very ugly, moreover very long, this structure only is useful is may separate the tree

生成图文并茂的word文档-Generation illustrated word document

一种改进的Boyer-Moore的字符串查找算法，并封装到类-an improved Boyer- Moore string search algorithms, and type of packaging

huffman编码-huffman coding

A*算法只要求产生问题的全部状态空间的部分结点及关系,就可以求解问题了,搜索效率较高。当然由于A*算法中没有回溯，因此某些情况下可能会找不到正确的解过程。 -A* algorithm only requires a problem all part of the state space and the relationship between nodes, we can solve the problem, the search more efficient. Of course, as a result of A* algorithm is not retroactive, so some cases may be unable to find the correct solution of the process.