经典问题：母牛问题，只是一个作业，希望能对初学者有点帮助...

its a c++ coding for fft algorithm...

约瑟夫环：编号为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.

一个来源于美国马里兰大学的GEEKOS操作系统的一个说明-An MD from the University of the United States in a note to the operating system GEEKOS

内部算法排序比较，按从小到大排序，快速算法，归并排序，冒泡排序等-Comparison of internal sorting algorithm, to sort by from small to large, fast algorithms, merge sort, bubble sort, etc.

atger hu sji ikat rayyaegydfshdytetw ry rtayadfg eyrtwtdfgdsyreterteryuerw

asp.net版本的开心农场源代码，完整的复制了目前开心农场游戏的内容，以FLASH为主要表现形式-asp.net source code version of Happy Farm, a complete copy of the current farm fun game content to FLASH as the main form of

一个扑克牌游戏集合的源码,包含了很多基本c-c++语言应用-a card game set the source, contains many of the basic c-c language

java 命令模式，能够实现OCp原则，实现代码重构，包括例子。-java command mode to achieve OCp principles, code remodeling, including examples.

通过遗传算法求解N皇后问题，用c++编写-Through the Genetic Algorithm for N queens problem, using c++ write

震动模拟数据采集，采集后的数据被存储在FLASH-Analog vibration data acquisition, data have been collected and stored in the FLASH