类似Windows xp开始菜单风格的VC++菜单源码

基因算法在认知无线电中的应用，希望对各位研究同仁有所用处。-Genetic algorithm in the application of cognitive radio, in the hope that some useful research Tongren.

Java固定资管理系统，jre1.4带数据库和文档-Java fixed-owned assets management system, jre1.4 with databases and document

这是一个XILINX公司的product_table-This is a XILINX

学习sql的好的ppt资料，对于学习数据库的是个好选择-Ppt learning sql good information database for the study is a good choice

Neural Net implementation

Socket建立服务器,比较简单，一看就清楚的程序代码

源代码是文本框滚动。单线模式显示底部多行模式显示端线。祝好运。

一款用c语言编写的坦克游戏，适合刚刚接触游戏的编程新手-c language used tanks games for the game just contact the programming novice

编写筛选查找素数函数： 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.

一个简单的俄罗斯方块小游戏，只需要使用上下左右方向键就可以方便的控制 -a simple little game Tetris, only need to use the direction keys above and below it can control