DELPHI processing data on the use EXCEL, it would be imported into the database...

八种排序的方法,利用VC++实现,值得借鉴-eight ranking, using VC, which is worth learning from

这是数据结构课程设计的4个原程序代码分别是数据结构课程设计――猴子选大王问题数据结构课程设计-This the data structure of curriculum design four original code was designed data structure courses-- monkeys elected king issues of curriculum design data structure

pb 源码 拷贝文件-pb code copy file

这是一个改进了自顶向下的归并排序，它改进的地方主要有：采用小子文件截止的机制，当序列长度小于32时，采用直接插入排序；对归并的内循环作了优化，判断的次数更少。-This is an improvement from a top-down sort of merger, it improved the main : the deadline for the paper boy mechanism, the length of the sequence is less than 32, the use of direct insertion sorting; Merging with the right circle made optimization, the number of less judgment.

银行定储模拟程序-Reserve Bank is scheduled simulation program

设计邻接表类,实现无向图的深度优先非递归遍历,无向图的广度优先遍历,并设计主函数输入数据进行测试-Design category adjacency list, realize undirected graph of the depth-first traversal non-recursive, non-directed graph breadth-first traversal, and the design of the main function of the input data for testing

一个用c++实现的最小生成树的源代码，希望对大家有所帮助哈-A used c++ Realize the minimum spanning tree of the source code, and they hope to help everyone Kazakhstan

Video rent program. simple

对二叉树结构作了清晰而简易的演示，可以帮助要了解二叉树结构和基本算法的人加深认识。可用VC直接编译运行。-On the binary tree structure was clear and simple presentation can help to understand the binary tree structure and the people a better understanding of the basic algorithm. VC can be used directly to compile run.

图论*匈牙利算法 的两种实现过程 Matching的巧妙在于队列的进入退出并没有仅仅限于在同一层循环中做到，构思巧妙 其算法思想在《算法设计与分析基础》上可以参阅-Graph theory* Two Hungarian Algorithm realization process ingenious Matching queue entry and exit is not just limited to the same level as the cycle done, the idea of clever ideas in their algorithm,