library

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

题意:给你n个数,求出两两组合的最大公约数 类似打素数表的做法 (Meaning of the questions: to give you the number n, find greatest common divisor of a similar combination twenty-two hit the practice table of prime numbers)

数据结构，利用霍夫曼树实现文本数据的压缩。(Huffman data compression and decompression.)

计算机博弈大赛不围棋的代码 个人所写，可以用来参考( U8BA1 u7B97 u673A u535A u5F08 u5927 u8D5B u4E0D u56F4 u68CB u7684 u4EE3 u7801 u4E2A u4EBA u6240 u5199 uFF0C u53EF u4EE5 u7528 u6765 u53C2 u8003)

随机函数产生10000个随机数，用快速排序、直接插入排序、冒泡排序、选择排序的排序方法排序，并统计每一种排序所花费的排序时间和交换次数。其中随机数的个数由用户定义，系统产生随机数。(Random function generates 10,000 random numbers using quick sort, insertion sort, bubble sort, select Sort sort Sort, and statistics for each sort spend the sort of time and the number of exchanges. Wherein the number of the random number defined by the user, the system generates random numbers.)

邻接表存储图，然后进行深度优先遍历及广度优先遍历。(DFS,adjacent matrix)

使用非递归的方法遍历二叉树，可以直接运行。( Non-recursive binary tree traversal.)

纯C语言写的小型通用数据库，一个C数据结构组科技小组的作品，附有开发思路PPT，这可是一个宝贵的资源哦，更底层的东西，运行于DOS提示符，可以新建数据库等操作。C的编程高手们值得参考一下。 (Pure C language to write a small general-purpose database, a data structure C Group Technology Group works to develop ideas with PPT, this is a valuable resource Oh, and the bottom of things, running on the DOS prompt, you can operate a new database. C programming masters worthy of reference.)

Huffman编码与译码，实现数据结构树的功能。(Huffman coding and decoding, data structure tree functions.)

本程序解决的是：模拟类似计算机主、缓存的存储结构，当用户请求某个页面时，若某个页面已在缓存中，则直接从缓存中去取，不会产生失误（即未在缓存中命中），否则，就到主存中去取，代价变大。 本程序采用随机标记算法，即在在线标记算法的基础上，对于替换页面时，采用随机从未标记的缓存项中选出一项进行替换。 代码、文档详尽(Addressed in this program are: analog computer-like main, cache storage structure, when the user requests a page, a page in the cache directly from the cache to fetch, does not produce errors (that is, not in the cache in the hit), otherwise, to the main memory to fetch a consideration of larger. This program uses a random marking algorithm, online marking algorithm based on random never mark the cache entry selected a replacement for the replacement page. Code, documentation detailed)