C++ Builder程序员学习数据结构第3章

这是数据结构第四章中串的全部算法代码，实现了全部算法，对学习数据结构的同学很有帮助-this is a code of data structure

给定n 个整数a ,a , ,an 1 2  组成的序列， a n i | |£ ，1 £ i £ n。如果对于i £ j ，有 0 = å = j k i k a ，则称序列区间i i j a , a , , a +1  为一个零和区间，相应的区间长度为j-i+1。-given n integers a, a, and an 1 2

prim算法的原理利用 prim算法构造最小生成树。有机的应用prim和数组存储生成树。-prim algorithm using the principle of Minimum Spanning Tree Algorithm prim. Application of organic prim and storage arrays spanning tree.

数据库连接池的代码-database connection pool code

最大频繁项集挖掘算法。运行前需将release中的data和result数据拷贝到上一级目录下。-Maximal frequent itemsets mining algorithm. Needs to be run before the release of data and result data are copied to the directory level.

输入学期总数 学期的学分上限 课程数 拓扑排序所形成的课程先修关系的边数 课程号及其学分 在各学期学期负担尽量均匀和 课程集中在前几个学期进行排课两种条件下进行排课-importation of the total semester credit semester courses ceiling few topological sorting as a result of the pre-course edge courses, and credits in the semester to semester burden of uniform and courses focused previous semester Course Scheduling for the two conditions under Course Scheduling

这是VC++操作EXCEL的一个例子，希望对大家有所帮助-this is a example of operate EXCEL with VC++,hope helpful to you!

设置信号放大器，在包中有详细的代码说明及注释，通过树的数据结构实现信号放大器的设置~-Set-signal amplifier, in the package are detailed code descriptions and notes, through the tree data structure to achieve signal amplifier settings ~

本程序集合了数据结构8种主要的排序方法：插入排序、冒泡排序、选择排序、快速排序、希尔排序、堆排序、归并排序、基数排序。-the procedures set of data structure of the eight major sequencing method : Insert ranking Bubble Sort, select, in order of Quick Sort, Hill sequencing, heap sort, merge, in order of ranking base.

创建二叉树，并实现二叉树前序、中序递归遍历算法和二叉树的后序非递归遍历-create binary tree, and to achieve binary tree before the sequence, sequence recursive traversal of a binary tree algorithm and after non- recursive traversal sequence