源码分享测试

利用C语言实现，8种排序算法！ 例如：插入排序、快速排序、选择排序、冒泡排序、堆排序、希尔排序、归并排序、基数排序！-using C language, eight algorithm! For example : insert sequencing, Quick Sort, select, in order of Bubble Sort, heap sort, Hill sorting, merging, in order of ranking base!

一． 问题描述很多涉及图上操作的算法都是以图的遍历为基础的。试写一个程序，演示在连通的无向图上访问全部节点的操作。二． 基本要求以邻接多重链表为存储结构。实现连通无向图的深度和广度优先遍历。以用户指定的节点为起点，分别输出每种遍历下的节点访问序列和相应生成树的边集。-one. Description many issues involving maps of algorithms are to traverse the map-based. A written test procedures, demonstrating the connectivity of undirected graph visit all the nodes on the operation. 2. Adjacent to the basic requirements for storage of multiple linked list structure. Connectivity to the map without the depth and breadth- first traversal. User specified nodes as a starting point, the output of each node traversal visit Spanning Tree sequence and the corresponding set of edges.

各种实用的子程序，包括数据类型的转换，芯片的驱动等-various practical subroutine, including the conversion of data types, such as driver chips

Matlab基础篇是Matlab初学者的一个很好的向导，它介绍了Matlab的安装及初等的使用方法-Matlab Matlab for the project is a good beginner"s guide, it introduced the Matlab the installation and use of primary

N皇后的排列树与子集数算法！里面是Cpp的源代码 带注释-N Queen subset of the arrangement of trees and the number of algorithms!

这是传统智能优化背包问题用VC++ 6.0的实现，是对背包问题分支限界的可视化算法实现-This is a traditional intelligent optimization knapsack problem VC++ 6.0 with the realization of knapsack problem is the visualization of branch and bound algorithm

源代码，是java实现的，比较清晰，具体自己看-Source code, is a java implementation, a more explicit and specific look at their own

多项式相加 pascal源程序-polynomial combined source

物业管理 1.建立一个WYGL数据库，恢复WYGL脚本，然后配置ODBC。 2.建立一个TLBackup数据库，配置ODBC。-a property management. WYGL establish a database, restore WYGL script, and then configure ODBC. 2. TLBackup establish a database, configuring ODBC.

解决了BruteForce算法效率低下的问题，并且在该基础上完成了子串重复时的性能优化