数据库查询、显示程序，使用access数据库，需要配置数据库程序才能使用...

//希尔排序void ShellSort(int r[], int n){ int i; int d; int j;    for (d=n/2; d>=1; d=d/2)            //以增量为d进行直接插入排序 {     for (i=d+1; i0 &am

这是一个生成全排列的程序,采用最小变化算法,相邻两个序列之间只有两个数的次序不同,每交换两个数,便形成一个新的序列,速度非常快.-This is a whole generation with a procedure using the smallest change algorithm sequence between two adjacent only two of several different order every two exchanged a few, it will lead to a new series, very fast.

给定正整数n，计算出n个元素的集合{1,2,?,n}可以划分为多少个不同的非空子集。 由文件input.txt提供输入数据。文件的第1 行是元素个数n。-Given positive integer n, to calculate a collection of n elements (1,2,?, N) can be divided into the number of different nonempty sets. By providing input data file input.txt. Document line 1 is the number of elements n.

问题描述： 给定n个石子，其重量分别a1,a2,a3...an,要求将其划分成m份，每一份的划分费 义为这份石了中最大重量与最小重量的差的平方。总划分费用等丁m份划分费用之和。 编程任务 对于给定的n个石子，求一种划分方案，使得总划分费用最小。-Description of the problem: Given n-stones, its weight, respectively a1, a2, a3 ... an, asked that it be divided into m copies, each of the division of costs defined as the weight of the stone of the largest and the smallest weight difference the square. Small m the total costs were divided into the sum of the cost. Programming tasks for a given n-stones, seek a kind of division, making the total cost of the smallest division.

寻呼台用户管理系统(vb6.0编写)-paging subscriber management system (vb6.0 preparation)

用VB实现的信用社贷款管理系统的课程设计，可以实现数据库中信息的查询、删除、修改等功能。-Using VB to achieve credit loan management system, curriculum design, can achieve the information in the database query, delete, modify other functions.

C++ Builder程序员学习数据结构第2章-Builder C programmers to learn data structure Chapter 2

拓扑排序，数据结构的作业。-topological sorting, data structure of the operations.

对Oracle OCI的封装- To Oracle OCI seal

一个很好的通讯录管理系统-a very good correspondence management system