汉诺(hanoi)问题采用递归算法解决，并编制了手动及演示界面

mathimatics library for pascal, include fft,function interpreter, derivative,solve sytem of lineal ecuacion by gauss .. and 2 examples-mathimatics library for pascal, include fft,function interpreter, derivative,solve sytem of lineal ecuacion by gauss .. and 2 examples

背包问题

书是针对工程上常用的行之有效的算法而编写的C语言函数程序集，在第一版的基础上作了修改和扩充。书中包括了近几年出现的许多新算法。全书分为数值计算与非数值计算两部分。其中数值计算部分的内容包括：线性代数方程组的求解、矩阵运算、矩阵特征值与特征向量的计算、非线性方程与方程组的求解、插值、数值积分、常微分方程（组）的求解、拟合与逼近、数据处理与回归分析、极值问题、数学变换与滤波、特殊函数、随机数的产生、多项式与连分式函数的计算、复数运算；非数值计算部分的内容包括：排序、查找、图形模式下读写屏幕象点、基本图形操作、汉字操作等。-book is widely used in engineering at the effective preparation of the algorithm and C language function suite, on the basis of the first edition was revised and expanded. The book includes the past few years, many of the new algorithm. Topics are divided into the numerical and non- numerical calculation of two parts. These numerical part of the contents include : linear algebraic equations by solving the matrix computation, Matrix eigenvalues and eigenvectors of computing, nonlinear equations and solve equations, interpolation, numerical integration, ordinary differential equations (Group I) solution, fitting and approximation, data processing and back In analysis, optimization, mathematical transformation and filtering, specia

符号积分法，有中文注释，大家试试，供参考学习~-Symbolic integration, notes in Chinese, we try, for reference to learn ~

一个求素数个数的程序 算pi(1000000000)不要1秒每个块如果10 0000, 需要 < 100000次全搜索加上8000 * 8000 < 6400 0000 总的次数小于7000 0000,就是说,搜索次数大大降低-for a few number-counting procedures pi (1000000000) not a second of each block of 10 0000, the need lt; Search 100,000 plenary with 8,000* 8,000 lt; 6400 0000 total is less than the number 7000 0000, that is to say, greatly reducing the number of search

#include < stddef.h > / * NULL * / #include"mpc.h" / * FIXME: 这是一个肮脏的修复程序 HOR_MXCONSTRS 零长度数组问题的 * / STATE_CONSTR #ifdef #define NO_MXCONSTR 0 #else #define NO_MXCONSTR 1 #endif / * 静态函数声明 * / 静态 void inc_ref_ctl_solve_problem (结构 mpc_ctl * ctl，const real_t x[]) ； 静态 void stc_ref_ctl_solve_problem (结构 mpc_ctl * ctl，const real_t x[]) ； 请点击左侧文件开始预览 ！预览只提供20%的代码片段，完整代码需下载后查看 加载中 侵权举报

Contents of this directory PROGRAMS  * Simple HMMs *  simpledemo.m - Simple demo of HMM code hmm.m - hmm code hmm_cl.m - code for calculating likelihood for an hmm  * Factorial HMMs * fhmm.m - factorial HMM code (exact algorithm -- very slow)

用VB语言编写的解决运筹学0-1规划的程序，可以作为大家提交作业的参考啊-Use VB language to solve 0-1 programming operations research procedures, can be used as reference for everyone to submit work ah

已经一整数n，求1！+2!+3!+4！+5！+6！+……+n！，n

Apriori算法的Matlab实现 可以自动生成关联规则，计算支持度、置信度