为了方便大家学习，上传了一个贪心算法的算法代码

算法源代码比较经典-algorithm source code comparison classic

用数组制作动画-Using an array of animation

数据库代码邮政管理数据库，邮政编码.mbd以及客户.mbd；使用

约瑟夫环：编号为1,2,3,…,n的n个人按顺时针方向围坐一圈，每人持有一个密码（正整数）。一开始任选一个正整数作为报数的上限值m，从第一个人开始按顺时针方向自1开始顺序报数,报到m时停止。报m的人出列，将他的密码作为新的m值，从他在顺时针方向上的下一人开始重新从1报数，如此下去，直到所有人全部出列为止。编程打印出列顺序。-Josephus : No. 1, 2, 3, ..., n n clockwise direction by individuals sitting around a circle, each holding a password (positive integers). An optional started as a positive integer reported limits on the number of m, from the first individuals to embark on the clockwise direction since the beginning of a sequence number off, the report m stop. M reported out of the list of his password as a new value m, from a clockwise direction in the next one started from a newspaper a few, like that, until the total of all listed so far. Programming print out the order.

用面相对象的思想，用c++是实现扑克牌的基本玩法-Face objects with thought, with c++ implementation are the basic rules of poker

.修改kspublib.jar文件中DBConfig.xml，将数据库配置为自己的数据库。 2.将optiontree.jar,kspublib.jar(需要xml解析器xerces.jar)拷贝到应用的web-inf/lib目录下-. Kspublib.jar to amend the document DBConfig.xml, the database is configured to its own database. 2. Optiontree.jar, kspublib.jar (need xml parser xerces.jar) copies to the application WEB-INF/lib directory

ti 的单相电机调速程序F24x ACI1_1 Single Phase ACI Motor Control using Constant VHz-ti single-phase motor procedures F24x ACI1_1 Single Phase ACI Motor Control using Constant VHz

实现游戏中对机器人进行矩形运动的智能控制算法-realization of the game for robot movement rectangular intelligent control algorithm

编写筛选查找素数函数： void sieve(bool isPrime[], int n) 其中isPrime[ ]为一个布尔型数组，n为数组大小。由于2是第一个素数， 所以设置isPrime[0]和isPrime[1]的值为false，并设置其余的元素初值为true。 然后对从4到n－1的每一个i，判断i是否能够被2整除，如果i能够被2整除，则设置isPrime[i]为false。 对从2到n/2的每一个可能的数值重复以上处理，当操作结束时，所有值为true的isPrime[i]所对应的i就是素数，它们将是从筛子中掉下来的。-Find prime numbers prepared by screening the function: void sieve (bool isPrime [], int n) which isPrime [] as a Boolean array, n is the size of the array. Because 2 is the first prime number, so set the isPrime [0], and isPrime [1] a value of false, and set the initial value of the remaining elements of true. And then from 4 to n-1 for each i, to determine whether i can be divisible by 2, if i can be divisible by 2, then set the isPrime [i] is false. From 2 to n/2 possible values for each one to repeat the above processing, when the operation ended, all the true value of the isPrime [i] corresponding to i is a prime number, they will be falling from the sieve in the past.

laser_damage_te用fdtd方法研究激光损伤-laser_damage_te fdtd method using laser injury