大整数乘法算法，可实现普通程序无法实现的大整数的相乘。算法简单，可作为数据结构与算法研究之用...

MATLAB queen常见的来到过程有定长输入、泊松(Poisson)输入、埃尔朗(A. K. Erlang)输入等-MATLAB queen

一个简单的记录集类，可以操作单个数据文件，可以用来存放单表数据-A simple type recordsets, you can operate a single data file that can be used to store a single table of data

文章详细讲解分支限界的基本思想，单元最短路径问题，装载问题，0-1背包问题，旅游售货员问题等。-Detailed article on the basic idea of branch and bound, the shortest path problem unit, loading issues ,0-one knapsack problem, travel salesman problem.

一个根据VC++开发的人事管理系统，可以实现一系列基本的数据库操作-VC development under a personnel management system that can achieve a series of basic database operations

该程序用于计算二项式系数，它采用动态规划的方法，其效率远远高于递归的方法，而且空间效率也很高。-the procedures used to calculate the binomial coefficients, which uses dynamic programming methods, the efficiency is far higher than the recursive method and space efficiency is also high.

这个项目用来跟踪政策的 LIC 数据库。通过使用此您可以搜索策略、 添加政策、 添加客户、 添加代理、 搜索 AGGENT，查看代理配置文件和更多。所以它是很好用的数据库。

这是由DELPHI7.0开发的一个商品销售系统，里面有齐全的源代码-This is DELPHI7.0 developed a merchandising system, which has complete source code

10名海盗抢得了窖藏的100块金子，并打算瓜分 这些战利品。这是一些讲民主的海盗（当然是他们自己特有的民主），他们的习惯 是按下面的方式进行分配：最厉害的一名海盗提出分配方案，然后所有的海盗（包 括提出方案者本人）就此方案进行表决。如果50%或更多的海盗赞同此方案，此方 案就获得通过并据此分配战利品。否则提出方案的海盗将被扔到海里，然后下提名 最厉害的海盗又重复上述过程-10 pirates seize a cache of 100 gold, and plan to divide up these spoils of war. This is the democracy of some pirates (of course it was their own unique democracy), their habits are based on the following manner allocation : one of the most powerful pirate proposed distribution plan, and then all the pirates (including the proposal himself) on this program for a vote. If 50% or more of the pirates agreed to this program, this program was adopted and on the allocation of spoils of war. Otherwise, the proposals will be pirates thrown into the sea, and then nominate the most serious piracy repeated this process

++数据库编程,详细介绍vc操作数据库的一些知识,包括dao,ado等等技术-++ Database Programming, vc detail the operation of some database knowledge, including the dao, ado, etc. technology

实现ADT,可以实现两个二叉树的几种逻辑关系来显示它们之间的联系.如:求两个二叉树是否是等价的.它们的交集并集是怎样的.等等.这样这些都是ADT要实现的方法.-achieve ADT, can achieve two binary tree several logical relationship to show the linkages between them. Such as : whether the binary tree for two are synonymous. The intersection of what is the set. And so on. ADT then these are the methods to achieve.