基于有限高斯混合模型的电磁算法源程序，其中哈…

vfp表单，锁住和解锁数据表。（压缩文件）-Probe form, the lock and unlock data sheets. (Compressed files)

这也是个数据库的编程，是演示如何连接远程的数据库的。-This is a database programming, shows how to connect to the remote database.

ISAM系统实现，含有BTREE源码，等-ISAM system containing BTREE source, such as

用vb做的一个关于学生信息管理的系统，功能齐全，适合做学生毕业设计。-Vb make use of a student information management system, full-featured, suitable for graduate students to do the design.

access dao 数据库-access dao database

这是一个学生成绩管理系统，运行之后可对学生的基本资料，成绩进行各项操作！-This is a student performance management system, running on students beyond the basic information for the various operating results!

卷3为分拣和搜索，这是本书的第1个修订版，它是对计算机分拣和搜索的一流技术的最全面的研究，它扩展了卷1中数据结构的处理方法，将大小数据库以及内存和外部存储都包含在内。本书包括对计算机方法仔细检查的选择方案，和其效率的大量分析。本书该版的独特之处在于优化了的分拣，以及对通用散列法和排列法的新的理论论述。-Volume 3 for sorting and searching, this is the book of a revised edition, it is sorted on the computer and search the first-class technology of the most comprehensive study of its expansion Volume 1 data structure handling methods, the size of the database and external memory and storage are included. The book including computer methods carefully examined the options, and its efficiency lot of analysis. The book version of the unique features of the optimization is sorted, and right hash law and common law with the new theoretical expositions.

问题描述： 给定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.

数据结构的演示，其中包括了大多数常用数据结构的算法图示和程序

N-皇后问题线性时间算法 O(n)复杂度，非O(n^2)的，使用的是构造法。-N-Queen problem of linear time algorithm