Freqences 规划师

线形的哦。很牛的，一般人不给他-oh. Very cattle, most people do not give him

介绍了GS算法的核心内容，为想学习GS算法的人士提供很好的参考-Introduction of the GS algorithm is the core content for the GS algorithm to learn to provide good reference

直接蒙特卡洛方法计算微管气体流动，主程序所选择的分子数及模拟单元可以修改，包含7个子程序，和一个随机数函数。-The air flow in micropipe with direct simulation mente kalro, we can use different simulation, fortran90

资源描述可在mfc框内生成随机数，然后进行随机数的排序

这是遗传算法的应用，用的是MATLAB语言编写的，我觉的会对大家有用。-This is the application of genetic algorithms using the MATLAB language, I think the people will useful.

在一个圆形操场的四周摆放着n堆石子。现要将石子有次序地合并成一堆。规定每次只能选相邻的2堆石子合并成新的一堆，并将新的一堆石子数记为该次合并的得分。试设计一个算法，计算出将n堆石子合并成一堆的最小得分和最大得分。 编程任务：对于给定n堆石子,编程计算合并成一堆的最小得分和最大得分。-Playground in a circle around the stones are placed n heap. Stone is to have the order to merge into a pile. Provisions can only choose 2 adjacent stones piled into a heap of new and new pile of stones a few in mind for its combined score. Try to design an algorithm to calculate the n heap into a pile of stones the minimum scores and maximum scores. Programming tasks: for a given n stack stone, into a pile of programming the calculation of the minimum scores and maximum scores.

开发一个项目，利用线性和非线性数据结构。执行的堆栈与队列使用的链接列表。排入队列，将出列，推，流行音乐，显示的操作。与循环链表的执行情况。插入删除打印查找操作二进制搜索树 ADT 实现与插入、 删除树的遍历，还在执行 Hashing 技术。使用示例数据项目进行测试。

这是一个简单的c#编码，用于转换以下长度：

一个求素数个数的程序 算pi(1000000000)不要1秒每个块如果10 0000, 需要 < 100000次全搜索加上8000 * 8000 < 6400 0000 总的次数小于7000 0000,就是说,搜索次数大大降低-for a few number-counting procedures pi (1000000000) not a second of each block of 10 0000, the need lt; Search 100,000 plenary with 8,000* 8,000 lt; 6400 0000 total is less than the number 7000 0000, that is to say, greatly reducing the number of search

Matrix的实例-Matrix