高效的c++科学算法库，提供了矩阵、复数等算法。

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

几百个数值算法-Hundreds of numerical algorithm

优化算法,是FORTRUN语言写。都经过了运行。-this is code of the number caculation in opt

*   *   To approximate I = integral ( ( f(x) dx ) ) from a to b:*   *   INPUT:   endpoints a, b; integer n.**   OUTPUT:  an array R. ( R(2,n) is the approximation to I. )**   R is computed by rows; only 2 rows saved in storage   

这个程序可实现最优二分检索树的构造，绘制和检索，请在Turboc 2.0下运行。-this procedure can achieve optimal two-tree structure retrieval, mapping and retrieval, please Turbo running under 2.0.

八数码多个算法-more than eight digital algorithm

计算光子晶体能带的程序，用fortran语言编写！好用！-photonic crystals can be calculated with the procedure, using FORTRAN language! Easy!

程序 P2.2; 使用 crt ； var 我、 n、 f： 整数 ； 开始 clrscr ； 重复 写 ("Introduceţi 联合国 număr 天然 n ="） ； readln(n) ； 直到 n > 2 ；

k均值聚类方法的c代码，并且带有聚类数据，适用于刚刚接触该算法的初学者-k-means clustering method c code, and with the clustering data, applicable to just access to the algorithms for beginners

给出一组数的全排列 如1,2,3给出 123,321,312-is a group of the whole arrangement is 123,321,312 as 1,2,3