说明：此代码是能实现一元多项式相乘的一个函数，请大家批评指导！...

好简单的方法-The simplest way to good

* 本算法用最小二乘法依据指定的M个基函数及N个已知数据进行曲线拟和 * 输入: m--已知数据点的个数M * f--M维基函数向量 * n--已知数据点的个数N-1 * x--已知数据点第一坐标的N维列向量 * y--已知数据点第二坐标的N维列向量 * a--无用 * 输出: 函数返回值为曲线拟和的均方误差 * a为用基函数进行曲线拟和的系数, * 即a[0]f[0]+a[1]f[1]+...+a[M]f[M]. -* The algorithm using the least-squares method based on the designated function of M and N-known curve data to be imported and* : m-- the known number of data points M* f-- From M* n vector function-- known data points the number N-1* x-- known data points of the first N-dimensional coordinates listed Vector* y-- known data points of the second N-dimensional coordinates shown in a vector*-- useless* Output : function return value to the curve-fitting and the mean square error* for the use of a base function and the curve fitting coefficients,* is a f [0] [0] a [1] f [a] ... a [M] f [M].

System will automatically delete the directory of debug and release, so please do not put files on these two directory.

simple scene -simple scene .........................

介绍LINUX的文件系统,来自网络,是一篇阐述文件系统的好文章-Introduction LINUX file system, from network, the file system is a good article

信号与系统的讲义，原理介绍的很详细，参考价值高-Signal and System handouts, principle introduced by the very thorough and high reference value

数据库系统概念！西安交大的课件，很经典-Database System Concepts! Xi" an Jiaotong University courseware, it is classic! ! !

图的邻接矩阵、邻接表、十字链表、邻接多重链表存储结构表示及其创建算法的c语言实现 图的深度优先搜索遍历算法和图的广度优先搜索遍历算法及C语言实现-the adjacency matrix, the adjacent table, Cross Chain, Listless multiple adjacent storage structure and said the creation algorithm in C Language map of the depth-first traversal algorithm and search a broad plan Search priority traversal algorithm and C Language

蚁群算法基本原理，改进蚁群算法等的详尽资料，很全面！-The basic principles of ant colony algorithm to improve the ant colony algorithm, such as detailed information, very comprehensive!