几种常用排序算法的效率比较,通过测试可得出这几种排序算法的优劣....

八皇后问题串行算法,可递推n皇后问题 C代码-eight queen question code

新大学英语精读1-6，中英文对照，播放速度可调，带源码，请另下mp3文件，请站长将上次上传的“大学英语精读”删除-new College English 1-6, bilingual and adjustable speed player, with source, under another MP3 file, the last station to upload the "College English" deleted

初学者的源c代码，一共5个，主要是c基础,包括文件操作。-c beginners source code, a total of five, mainly c base, including file 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.

Csharp 代码示例中，我买了代码开发 Csharp 本书，这本书包含了 101 csharp 代码示例，今天我上传了书上所有的例子，我希望本书的例子对大家能有帮助。

数据库存储管理的实现，根据输入文件建立 B + 树索引和散列索引，并将索引存入外存文件中。实验实现 B + 树索引的建立、查找、插入、删除，以及索引写入外存、重新读入和重构等功能

非常好用的在线考试系统，本版本为测试版，如有兴趣请购买正式版-Very easy to use online testing system, the beta version, if interested, please buy the official version

可实现矩阵转换，螺旋数组，数字移动，数组操作，桶排序，杨辉三角形-conversion matrix can be realized, helical array, digital mobile array operation, barrels, in order of Yang Hui triangle

这是字符串匹配算法中很著名的KMP算法，此文件仅供大家参考，具体是否能调通，本人还没有试过-This is a string matching algorithm is famous KMP algorithm, this document is your reference, specifically whether Qualcomm will emphasize, I have not tried

篮球赛抽签系统，先输入球队数，由随机函数在1-N抽取一个数，作为初始密码，出列第一支球队，然后根据各队输入本队密码，利用joseph环，使每次出列的球队密码作为新的密码，直到所有球队出列，即可确定分组顺序-Basketball lottery system, first enter the team number by the random function in the 1-N taken a number, as the initial password, the first teams out of the column, and then each team enter the team password, using joseph ring, so that each second team out of the column as a new password password, until all the teams out of the column, you can determine the packet sequence