有一个魔王总是使用自己的一种非常精练而抽象的语言讲话，没有人能听得懂，但他的语言是可以逐步解释成人能听懂的语言，因为他的语言是由以下两种形式的规则由人的语言逐步...

资源描述利用哈希表进行姓名查找，实现了快速查找姓名功能、哈希表展示功能，并且会统计出平均查找长度，数据结构哈希表的应用以及课程设计可参考。

ssd7的本人的答案， 供大家参考, 希望大家喜欢-ssd7 exercise1

吉林大学计算机科学学院2005年制作的ACM/ICPC代码库，里面的代码比较详细，清晰-Jilin University School of Computer Science in 2005 production of ACM/ICPC code base, which code for more detailed, clear and

C++方面有深度的算法例子，提供完整源代码-C++ Aspects algorithm-depth examples, provide a complete source code

该程序是分布计数排序，它是我所见过的各种排序方法中最快的，它的时间复杂度为O(n),但是这种排序适用于已知待排序列的上下限，并且如果上限与下限的差值比较大的话，空间消耗也比较大．-distribution of the program is counting sequencing, it is I have seen the fastest sorting methods, it"s time complexity of O (n), but this sort known to be applicable to sort out the range, and if the upper and lower limits of the relatively large margin, space consumption is relatively large.

NexusDB manual (chm format)

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

pb 源码 进度条例子-pb progress of the sub-source

GFDGRTFDGFHGHFGFHGFGCFDGDFGEWTRRETERTRETTTTTT公司

用链表来实现的一个学生成绩管理管理系统，操作简单，清晰明了。-With a list to achieve the management of student achievement management system that is simple, clear.