不错的矩阵求逆的小程序

二分查找又称折半查找，优点是比较次数少，查找速度快，平均性能好；其缺点是要求待查表为有序表，且插入删除困难。因此，折半查找方法适用于不经常变动而查找频繁的有序列表。首先，假设表中元素是按升序排列，将表中间位置记录的关键字与查找关键字比较，如果两者相等，则查找成功；否则利用中间位置记录将表分成前、后两个子表，如果中间位置记录的关键字大于查找关键字，则进一步查找前一子表，否则进一步查找后一子表。重复以上过程，直到找到满足条件的记录，使查找成功，或直到子表不存在为止，此时查找不成功。

本代码是《计算机常用数值计算算法与程序 C++版》一书的配套复数运算代码，每个源程序文件的文件扩展名都使用.cpp形式。这些C++程序已经在微软公司Windows 平台下的Virsual C++ 6.0环境下通过-the code is "commonly used computer numerical algorithms and procedures C version," a book supporting complex computing code, each source document file extensions are used. Cpp form. These procedures have been in C Microsoft Windows platform under the Virsual C 6.0 environment through

高斯消去解方程组c-Gaussian Elimination Solution equation c

用BP网络完成函数的逼近源程序- Completes the function with the BP network to approach the source program

用牛顿法解非线性方程组(包括论文及源程序)-with Newton method for solving systems of nonlinear equations (including papers and source)

The Kalman filter30 is a minimum-variance filter in which time-series measurements are incorporated recursively into estimates of state variables it is the optimal, Bayesian least-squares estimator for linear dynamic systems.-text

自己编写的集合覆盖问题的贪心近似算法，请指教-I have written a collection of coverage of the greedy approximation algorithm for the problem, please advice

Delphi 写的常用的基本算法 源代码 -Written in Delphi source code for the basic algorithm used

农夫过河问题的广度优先搜索算法的PASCAL程序-farmer across the river in breadth- first search algorithm procedures PASCAL

资源描述针对传统的贝叶斯算法做了相应的改进，使得效率提升了一些。里面的原始代码来自于《learning in action》这本书，这里针对源代码做了新的改进，从而提升准确率。