MillerRabin()

新建复数类进行复数运算，重载+、=+、*、/等运算符用于复数间的运算。(New complex class complex operation, overloading+ =+,*,/operator for computing the plural.)

This directory contains code implementing the K-means algorithm. Source code may be found in KMEANS.CPP. Sample data isfound in KM2.DAT. The KMEANS program accepts input consisting of vectors and calculates the given number of cluster centers using the K-means algorithm. Output is directed to the screen. Usage for KMEANS is: KMEANS SOURCEFILE <enter> The format of the source file is: NPat - Number of patterns (int) SizeVect - Size of vector (int) NClust - Number of cluster centers(int) vect[1,1] ... vect[1,SizeVect] - vector 1 (real) vect[2,1] ... vect[2,SizeVect] - vector 2 (real) . . . . . . vect[NPat,1] ... vect[NClust,SizeVector] - vector N (real) To compile: ICC KMEANS.CPP <enter> (This directory contains code implementing the K-means algorithm. Source code may be found in KMEANS.CPP. Sample data isfound in KM2.DAT. The KMEANS program accepts input consisting of vectors and calculates the given number of cluster centers using the K-means algorithm. Output is directed to the screen. Usage for KMEANS is: KMEANS SOURCEFILE <enter> The format of the source file is: NPat - Number of patterns (int) SizeVect - Size of vector (int) NClust - Number of cluster centers(int) vect[1,1] ... vect[1,SizeVect] - vector 1 (real) vect[2,1] ... vect[2,SizeVect] - vector 2 (real) . . . . . . vect[NPat,1] ... vect[NClust,SizeVector]- vector N (real) To compile: ICC KMEANS.CPP <enter> )

数值计算实例，主要有LU分解，龙格库塔法，高斯分解法，欧拉法，曲线拟合，曲线插值(Numerical example)

之前找不到合适精度的log2x函数的定点化源码，经过实现并验证后，发上来大家一起学习(fixed version for log2x)

计算器编程代码，便于需要编程计算器的学员查询相关代码(Calculator programming code, to facilitate students in need of programming calculator related code)

说明：  算法设计第三版，算法设计第三版，算法设计第三版，算法设计第三版(Algorithm Design Third Edition)

一些简单的UDF文件，实现流场中梯度和某一点压力的检测提取(Some UDF profiles)

实现扫雷功能,基于c语言实现的，能够控制输入矩阵的大小(Implement demining capabilities, based on the c language, able to control the size of the input matrix)

计算牛顿和拉格朗日插值方法,用户输入插值结点(calculated Newton and Lagrange interpolation methods, user input interpolation nodes)

弗洛伊德算法最短距离的实现，输入为邻接矩阵，输出为最短距离矩阵。(Freud' s realization of the algorithm for the shortest distance, enter the adjacency matrix output for the shortest distance matrix.)