程序以图形的形式对各种排序的效率进行对比，是学习排序算法的很好的工具...

实验室设备管理系统 vb 需要的可以参考下-shiyanshi shebei guanli xitong

马踏棋盘问题，数据结构中的知识点,欢迎大家下载-this is about the datastructure,you can see it

1、 字符串由随机产生的1~16位的字母组成，然后用插入排序、冒泡排序、堆排序、快速排序、归并排序对字符串进行排序。-1, the string randomly generated by the 1 ~ 16 of the letters, and then use Insertion Sort, Bubble Sort, Heap Sort, Quick sort, merge sort to sort on the string.

1 可执行程序TestLexicon.exe必须与数据库文件在同一个目录下 2 数据库文件名为： lexicon.mdb，可以是access 97版格式的数据库， 也可以是access 2000版格式的数据库 3 双击TestLexicon.exe启动程序 4 选择“词典数据库”下“词库查询1”等进行查询，状态栏显示每个查询的 区别。程序反馈消息框响应用户的查询-One executable program TestLexicon.exe must be consistent with database files in the same directory 2 database file is named: lexicon.mdb, can access 97 database format, as well as access 2000 format database 3 Double-click TestLexicon.exe startup procedure 4 select

MFC实现的图书馆管理系统，希望对大家有用。-MFC library management system to achieve the hope for all of us.

用vfp实现的工资管理系统源码，可实现中小企业员工工资自动化管理。-Implemented using vfp salary management system source code, can realize automatic management of small and medium enterprises, wages and salaries.

SKiplist是一种概率应用于平衡树的替换数据结构。-Skip list is a probabilistic alternative to balanced trees that provide much of the simplicity of unbalanced trees , togethere with good worst-case expected performance.

输入稀疏矩阵中非零的元素，然后建立整个矩阵，实现这两个矩阵相加、相减和相乘运算。 -Enter non-zero elements of sparse matrix, and then build the whole matrix, to achieve these two matrices are added together, subtraction, and multiplication operations.

最小生成树问题 若要在n个城市之间建设通信网络，只需要架设n-1条线路即可。如何以最低的经济代价建设这个通信网，是一个网的最小生成树问题。 （1）利用克鲁斯卡尔算法求网的最小生成树。 （2）实现教科书6.5节中定义的抽象树类型 MFSet。以此表示构造生成树过程中的连通分量。 （3）以文本形式输出生成树中各条边以及他们的权值。 -minimum spanning tree problem to the n-city building communications networks needed to put up only n-1 lines can be. How the lowest economic cost of building the communications network, the network is a minimum spanning tree problem. (1) using Kelushikaer network algorithm for the minimum spanning tree. (2) to achieve 6.5 textbook definition of the abstract tree types MFSet. Spanning Tree Construction said this process of connectivity components. (3) the form of text output spanning trees and the edge of their weights.

算符优先函数 设计一个给定算符优先分析表，用有向图法构造算符优先函数的算法。-Operator to design a priority function given priority operator analysis table, and have to graph structure function operator priority algorithms.