在学习数据结构时，往往不知道那些结构与算法有何用，以及怎么用。这个小小程序充分显示了Huffman二叉树的应用。虽然其压缩效果比RAR相差甚远，但也能说明一二。...

学习C语言时，编写的一个多项式刮号检查程序 主要用栈实现的。-C language study, prepared by a polynomial scratching, the main inspection procedures Stack realized.

调用存储过程，使用外链接，方便用户操作。-Call stored procedure, the use of outside links, user-friendly operation.

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

Libgist is an implementation of the Generalized Search Tree, a template index structure that makes it easy to implement any type of hierarchical access method (AM). -Libgist is an implementation of the Generalized Search Tree, a template index structure that makes it easy to implement any type of hierarchical access method (AM).

C++ Builder程序员学习数据结构第4章-Builder C programmers to learn data structure Chapter 4

求解约瑟夫问题。设有n个人围成一个圆圈坐下，对所有围从的人从某个位置开始编号为1,2,3，……，n,从编号为1的人开始报数1，报数依交进行，报数n的人即出列，下一个人从1开始报数，再报数m的人便是第二个出列的人如此重复下去，直到最后一个人出列为止，于是便得到一个出列的顺序，这称之为约瑟夫(Josephu)问题。-solving problems. N individuals have formed a circle to sit down, all right Wai from the start from a position of No. 1, 2, 3, ..., n, for a number of people reported a few, according to several newspaper pay, the newspaper n ie the out, the next person was from the beginning a few , and reported m is the second out of this series continue to repeat until the final out in a series, then get a series out of order, which called Joseph (Josephu) problem.

c语言编写，利用六种方法进行排序运算，以此对比各种排序方法的特点，包含源程序和课程设计报告。-c language using the six methods of sorting operations, thus comparing the characteristics of a variety of sorting methods, including source code and curriculum design report.

以高效率的方法查找一个数组中的第二大数，数组中的数可以相同.同时对各种可能发生的错误返回相应得错误代码。-find second max number in a high effective method.The number in the array could be the same.meanwhile ,the program return special error code

用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.

用C生成一个课程二叉树,同时先、中、后序遍历该二叉树-C programs generated a binary tree, first, during and after the preorder the binary tree