8 益智受理的启发式算法

这是一段关于四种排序方法的完全源代码及其相互之间的比较,包括:Heap sort,Merge sort,Quick sort,Radix sort-This is a period of about four kinds of methods to sort the complete source code and the comparison between, including: Heap sort, Merge sort, Quick sort, Radix sort

压缩文件中是C语言常用函数的PDF文档，非常全面，可以满足工程人员的大部分需求。-compressed files is common C language function PDF files, a very comprehensive, engineering staff to meet the needs of the majority.

牛顿迭代法解方程组 写得比较简单 但是使用-Newton" s iterative method solution of equations written in relatively simple, but the use of

这是一个用Turboc2.0写的程序，实现了组合数学的字典序法。详细可以参考卢开澄的《组合数学》清华大学出版社-Turboc2.0 used to write procedures to achieve a combination of mathematics lexicographic law. Detailed information can be opened Cheng Lu "Combinatorial Mathematics" Qinghua University Press

C#编写的二重积分算法-数值分析算法-C# prepared by the Double Integral algorithm- numerical analysis algorithm

对数回归方程 LogarithmRegress.cs 方程模型为 Y=a*LnX+b public override double[] buildFormula() 得到系数数组，存放顺序与模型系数相反，即该数组中系数的值依次是b,a。 public override double forecast(double x) 预测函数，根据模型得到预测结果。 public override double computeR2() 计算相关系数（决定系数），系数越接近1，数据越满足该模型。 -Logarithmic regression equation LogarithmRegress.cs equation model for Y = a* LnX+ Bpublic override double [] buildFormula () get coefficient array, the storage order and model coefficients contrary, that is, the array is followed by the value of coefficient b, a. public override double forecast (double x) prediction function, according to the results of model prediction. public override double computeR2 () calculated the correlation coefficient (determination coefficient), coefficient of the closer one, the data satisfy the model more.

资源描述该算法无需对信源协方差矩阵进行特征值分解，大大降低运算复杂性，利用构造出的传播矩阵与导向矩阵的正交性构造一个函数，通过对角度进行搜索获得几个最大的谱峰值，谱峰值对应的角度即为信源的波达角估计值。

图书馆管理系统 C+ + * 递归程序为线性搜索 * /#includeint 线性 （int []，int，int） ；无效的主要 （）{int a [20]，pos = 1，n，k，我 ；clrscr() ；printf ("nEnter n 值："） ；scanf ("%d"，& n) ；printf ("nEnter 元素的数组："） ；为 （我 = 0 ； 我 < n; i + +)scanf ("%d"& a[i]) ；printf ("n 输入要搜索的元素："） ；scanf ("%d"& k) ；pos=linear(a,n,k) ；if(pos!=-1)printf ("n 搜索成功，发现位置 %d 处的元素"，pos) ；其他printf ("搜索失败，找不到元素"） ；残培 （） ；}int 线性 int k int n int []）{int ；为 （我 = n-1 ； 我 > = 0; 我 — —){if(a[i]==k)return(i) ；其他{n = n-1 ；return(linear(a,n,k)) ；}}返回-1 ；}

资源描述CS7495 Final Project  Sooraj Bhat Object Removal by Exemplar-based Inpainting USING THE CODE Everything was done in Matlab and MEX (i.e. a C function callable from Matlab).  First, the C code needs to be compiled.  At the Matlab prompt, type:    mex bestexemplarhelper.c You should then be able to run the following (which takes ~2mins on my 2GHz Pentium 4 laptop with 256MB of RAM):    [i1,i2,i3,c,d,mov] = inpaint("bungee0.png","bungee1.png",[0 255 0]); A smaller run (~25 seconds) would be:    [i1,i2,i3,c,d,mov] = inpaint("bw0.png","bw2.png",[0 255 0]); To visualize:    plotall;    close; movie(mov); SAMPLE IMAGES & RESULTS *0.png      The original images ("bw" and "bungee") *{1,2}.png    The different fill region masks. *P2.png     &nbs

两个矩阵相乘的源程序- Two matrices multiplication source program