Joseph A solution, the main use of the array to resolve the symbol C++ Source co...

这是两个集合交并的一个算法-two pools and a reference algorithm

hash排序，用hash法进行字符或数字的排序。-hash

这是一个霍夫曼编码解码的源程序,可以用它高效实现霍夫曼解码编码,注释详细,可读性好.压缩包止包括源程序文件,再vc中运行.-Hoffman codec of the source, can be used to achieve efficient codec Hoffman Notes detailed and readable. Compressed only those source files, then vc run.

RDBMS Design and Implementation: Normalization

红黑树算法，是高级数据结构中必须学习的一种特殊二元查找树，也是很有实际用处的一个算法。-Tree algorithm, senior data structure must learn a special binary search tree, also very practical usefulness of an algorithm.

邻接表，邻接矩阵的创建以及对它的一些操作等-Adjacency list, adjacency matrix, as well as the creation of some of its operations

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

前序线索二叉树的前序遍历 中序线索二叉树的中序遍历 后序线索二叉树的后序遍历-Preorder clues before the binary tree traversal sequence which leads the order of the binary tree traversal sequence clues after the binary tree after preorder

一个简单的minisql，能实现sql语句的基本功能，创建、查询和删除，创建索引等-a simple minisql, sql statement to achieve the basic functions to create, search and delete, create indexing

大二算法设计实验源码，内容包括线性时间选择，01背包，骑士巡游，最小生成树-Experimental Algorithm Design sophomore source, including choice of linear time, 01 backpacks, Cavalier Parade, minimum spanning tree