矩阵连乘积的加括号方式数

Runge-Kutta-Fehlberg method

7. 求矢量夹角余弦 8. 求线段之间的夹角 9. 判断线段是否相交10.判断线段是否相交但不交在端点处 11.求线段所在直线的方程 12.求直线的斜率 13.求直线的倾斜角14.求点关于某直线的对称点15.判断两条直线是否相交及求直线交点16.判断线段是否相交，如果相交返回交点-7. For vector cosine angle 8. For the angle between the line 9. Line judge whether the intersection 10. Line judge whether the intersection but do not pay the endpoint Office 11. For the straight line segment where equation 12. For a linear slope 13. Seeking straight tilt angle 14. For a certain point on a linear symmetrical 15 points. to judge whether the intersection of two straight and for 16 straight intersection. Line judge whether the intersection, the intersection to intersection

FFmpeg README ------------- 1) Documentation ---------------- * Read the documentation in the doc/ directory. 2) Licensing ------------ * Read the file COPYING. ffmpeg and the associated libraries EXCEPT   liba52 and libpostproc are licensed under the Lesser GNU General   Public License. * liba52 and libpostproc are distributed under the GNU General Public   License and their compilation and use is optional in ffmpeg. Fabrice Bellard.

资源描述C语言简单迷宫小程序，随机生成迷宫并求解绘图                                                                                                                                                                                                                                                                

这是我编的利用三次样条法进行函数插值的程序。-This is for my use of cubic spline function interpolation method procedures.

数字信号处理 实验 的matlab 源码-Digital signal processing matlab source experiment

背包问题或背囊问题是组合优化中的一个问题： 鉴于一组项目，每个都有大量和一个值，确定每个项目中包含在集合中，这样，总重量是小于或等于给定的限制和总价值是尽可能大的编号。它把它的名字源于所面对的人的问题，受的限制，大小固定的背包，并必须填充的最有价值的项目。 此代码是背包问题的动态编程和递归函数。

一个简单的计算器程序，进行简单的数学计算，正确无误-A simple calculator program to carry out simple mathematical calculations are correct

ACM必备精品，先来一段比较函数。 int compare(char * c1,int s1,int e1,char *c2,int s2,int e2) { while(c1[s1]=="0"&&s1

Adaptive Grids for Clustering Massive Data Sets - MAFIA. It is a subspace clustering algorithm.-Adaptive Grids for Clustering Massive Data Sets- MAFIA. It is a subspace clustering algorithm.