这是用PB编写的招生管理系统!很不错的东西哦!希望能对大家有用!...

对二叉树结构作了清晰而简易的演示，可以帮助要了解二叉树结构和基本算法的人加深认识。可用VC直接编译运行。-On the binary tree structure was clear and simple presentation can help to understand the binary tree structure and the people a better understanding of the basic algorithm. VC can be used directly to compile run.

dBaseIII的源码。-dBaseIII the source.

用VC++实现数据结构中：在指定的位置上，线性表的插入 -Using VC++ implementation: ~ linear table data structure insertion

哈夫曼编码(Huffman Coding)以哈夫曼树─即最优二叉树，带权路径长度最小的二叉树，经常应用于数据压缩。-Huffman coding (Huffman Coding) ─ a Huffman tree that is optimal binary tree, with the right of the path length of the smallest tree, often used in data compression.

有关sql函数的知识-sql function of the knowledge

数据结构教程 C-data structure tutorial for c

这是李春葆的《数据结构全书》的源码，亲测运行通过，比较适合自学数据结构，好东西当然不能独吞了，好评呦，亲！适合考研的同同学

数据库实习的很好的课题-database attachment very good subject

SQL参考-SQL reference

用prim算法实验最小生成树 本程序中用到函数adjg( )，此函数作用是通过接受输入的点数和边数，建立无向图。函数prg( )用于计算并输出无向图的邻接矩阵。函数prim( )则用PRIM算法来寻找无向图的最小生成树 定义了两个数组lowcost[max],closest[max]，若顶点k加入U中，则令lowcost[k]=0。 定义二维数组g[ ][ ]来建立无向图的邻接矩阵。 -Prim algorithm using minimum spanning tree of the experimental procedures used in function adjg (), this function is through the acceptance of input points and edges, the establishment of a directed graph. Function of prg () used to calculate and output undirected graph of adjacency matrix. Function prim () is used PRIM Algorithm to find the undirected graph of the minimum spanning tree array defines two lowcost [max], closest [max], if it joined the U of k vertices, then the lowcost [k] = 0. The definition of two-dimensional array g [] [] to create a undirected graph of adjacency matrix.