using Java to write the data structure of the stiffness This algorithm is counti...

本程序主要是实现数组的全排列，当用户输入一个数字串时，程序将打印出该数字串的所有组合-This program is mainly to achieve an array of full array, when a user enter a number string, the program will print out the number of strings of all the combinations

OracleDatabase10g实用培训教程-OracleDatabase10g practical training tutorial

Access数据库下实现的系统，功能很强大，适合初学者学习~-Implemented under the Access database system, function is very powerful, suitable for beginners to learn ~

给定信源符号概率，自动huffman编码，建立二叉树，打印符号编码，还可打印二叉树的外形，对于数据结构二叉树一节的学习很有帮助。

p2pdbanywhere 可以通过之udp方式远程连接数据库的组件,这个组件非常好,是Delphi7,9,2006能够使用,包含源码.-p2pdbanywhere adoption udp can approach the remote database connectivity components, this component was very good Delphi7, 9,2006 to use, contains source.

民间标会的会员管理用的软件。是为一个顾客定做的！-civil standard to be a member of the management software. For a customized!

二叉树算法,如何构造二叉树以及对二叉树的操作-BinaryTree

演示执行集合的并,交,差运算,是以有序链表表示集合.判定子集,求补运算也实现了.-demonstration and implementation of the pool, intersection, difference, computation, is set in an orderly Chain said. Convicted subset, seeking fill operation has been achieved.

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

delphi中使用ADO的源代码-use of the source code for ADO