对难于时行积分的方程y=x*sin(x),用蒙特卡洛方法进行了求解。

资源描述 Design a program to implement the 1-D FFT algorithm. Input: a vector. Get the testing data in file ‘Project_2_test’. Output: a vector, which is the discrete Fourier transform of the input. For example: Input: 3 8 10 12 Output: 33.0000+0.0000i -7.0000+4.0000i -7.0000+0.0000i -7.0000-4.0000i Requirements:

ACM题目精选，参加ACM大赛有极大的帮助； 数据结构 -ACM topics selected to participate in ACM contest has great help data structure

使用自上而下分析法，实现了预测分析程序，主要包括求非终结符的First集，Follow集，和分析表，最后使用栈对文法进行分析。使用VC++6.0打开工作空间便可以直接运行。

MATLAB编的最优化算法，利用armijo算法进行线搜索。armijo算法是最优化问题中确定步长最常用的算法之一，可以比较快速高效的确定收敛步长。

This function plots the contours of 3d gaussians as ellipsoids. Quite useful.

dijkstra最短距离算法的C语言实现。 dijkstra算法是网络中最短距离的一种基础算法，代码包含main函数，linux运行成功

cvm的c语言版，mysvm-manual工具箱介绍-c language version of the CVM, mysvm-manual introduction Toolbox

曲线拟合程序 多项式相关系数的计算方法(多项式形式1) 多项式相关系数的计算方法(多项式形式2) 最小二乘法曲线拟合 三次样条插值（自然边界条件）-polynomial curve fitting procedures correlation coefficient is calculated (the form of a polynomial) polynomial coefficient of correlation Methods (polynomial form 2) least-squares method curve fitting cubic spline interpolation (natural boundary conditions)

数独求解 每行和每列和每小格为1到9的数字,用程序求解的算发.-several independent firms for each and every line and every small units of one to nine the number of procedures for the count fat.

自动俄罗斯方块，能够自己消行，消行达到15000左右，但有些还待改进-Auto Tetris, to make their own consumer line, elimination of about 15,000 lines, but there are still room for improvement