可移动的复杂定向金字塔

C++经典数值算法源码 包括多个经典的数值算法-C++ Classical numerical algorithm source code, including a number of classical numerical algorithm

FORTRANvisualfortran常用数值算法集及源码-FORTRAN visualfortran numerical algorithm commonly used to collect and FOSS

Algoritmo de ordenação 单纯 chamado 冒泡排序，ou método bolha。Ordenação um comum e 单纯 de 矢量。É um porém eficiente 段的小家伙 vetores algoritmo ruim。

matlab编写的流体计算和传热程序-Matlab calculations prepared by the fluid and heat transfer procedures

这是一个猫吃老鼠问题的改进算法。-This is a problem of cats eat rats improved algorithm.

本文件包含三个小程序，分别为用fft实现功率谱估计、实现快速卷积和快速相关。对了解fft在c中的编程很有帮助-This document contains three procedures were used to achieve power spectrum estimation fft, fast convolution and fast correlation. Fft to know programming in c in the helpful

这是刊登在报纸的混合矩阵估计算法的 matlab 代码 V.G.Reju、 S.N.岛和 I.Y。很快，"为混合的瞬时盲源分离中的矩阵估计算法，"信号处理，卷第 89 9 期，2009 年 9 月，页 1762–1773.

98年全国大学生数学建模竞赛B题“水灾巡视问题”，是一个推销员问题，本题有53个点，所有可能性大约为exp(53),目前没有好方法求出精确解，既然求不出精确解，我们使用模拟退火法求出一个较优解,将所有结点编号为1到53,1到53的排列就是系统的结构,结构的变化规则是:从1到53的排列中随机选取一个子排列,将其反转或将其移至另一处,能量E自然是路径总长度。具体算法描述如下：步1： 设定初始温度T，给定一个初始的巡视路线。步2 ：步3 --8循环K次步3：步 4--7循环M次步4：随机选择路线的一段步5：随机确定将选定的路线反转或移动，即两种调整方式：反转、移动。步6：计算代价D，即调整前后的总路程的长度之差步7：按照如下规则确定是否做调整：如果D0,则按照EXP(-D/T)的概率进行调整步8:T*0.9-->T,降温-98 National Mathematical Contest in Modeling B and that the "flood inspections", is a salesman problem, and that is 53 points, all possibilities about exp (53), there is no good way to get accurate solutions, since no exact solution for, we used simulated annealing France obtained an optimum solution to all nodes to a number of 53 to 53.1 is with the system structure, changes in the structure of the rules is : from 1-53 with a randomly selected with a son, to reverse or to move it to another, the energy E is the natural path length. The specific algorithm is described as follows : Step 1 : The initial set temperature T,

几种常用排序编码方法，冒泡等方法                                                  

单正态检验.rar程序源代码-single test is studied. Rar source code