巨大的记忆小游戏是一个很大的乐趣，用C++语言，请指教

VC++数据结构与算法经典的上百种源码包，绝对对C++编程有帮助，涉及数学、底层编程、校验算法、问题算法、文件算法、大小写转换、进制转换、字符转换、数组、单链表、二分查找、汉诺塔算法以及其它一些常用算法，有的含有示例，C++编程不可多得的编程资料-VC++ data structures and algorithms on hundreds of classic source package, absolutely on the C++ programming help, involving mathematics, the underlying programming, calibration algorithms, the issue of algorithms, document algorithms, case conversion, hexadecimal conversion characters conversion, arrays, single-linked list, binary search, Tower of Hanoi algorithm, as well as some other commonly used algorithms, and some contain examples, C++ programming rare programming information

1：FIFO和LIFO程序；2：CRC校验码算法-1: FIFO and LIFO procedure; 2: CRC verification code algorithm

张勇的linQ学习P2P及IM软件的极佳素材代码-Zhang Yong, the peer-to-peer learning and IM excellent source material

一个matlab time dot main cross-correlation， 解压后在matlab里运行即可，可计算各种数字信号的延迟，没有密码-a Matlab time dot main cross-correlation , unpacked were operating in Matlab can, translate various digital signal delays, no password

c#初学者必读的几篇文章，对学c#很有帮助的！-c# beginners must-read articles on science c# helpful!

频繁模式挖掘算法，可以用于数据挖掘中关联规则的频繁项集挖掘- The frequent pattern excavation algorithm, may use in the data mining to be connected the rule the frequent item of collection to excavate

本套网络视频教程由提供，解压后，打开主文件夹下的文件即可收看视频。-This set of video tutorials from

ERwin的使用教程,非常好,本人就事看此教程入门的.-ERwin use of tutorials, very good, I do look at this tutorial on getting started.

此源码是传统的飞机游戏,在游戏的过程中背景图不断的变化,挺不错的,先玩玩,在看代码-this source is the traditional game of the aircraft, in the course of the game background map the changing sounds very good first play, in view code

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