这是一段关于四种排序方法的完全源代码及其相互之间的比较,包括:Heap sort,Merge sort,Quick sort,Radix sort...

本代码是《计算机常用数值计算算法与程序 C++版》一书的配套矩阵运算代码，这些C++程序已经在Virsual C++ 6.0环境下通过。注意，在VC++ 6.0中设置好路径，特别include目录(文件夹)的路径，否则在编译时会出现找不到头文件的错误，使编译无法正常进行。-the code is "commonly used computer numerical algorithms and procedures C version," a book supporting matrix calculation code, these procedures have been in C C 6.0 Virsual environment through. The attention of the VC 6.0 installed path, in particular include directory (folder) path, otherwise there will be compiled header files could not find the mistakes and the compiler not normal.

由于MFC没有封装DIB类，编写面向对象的的DIB类，易于维护和移植；然后提供数学形态学代码，实现图像各种形态学运算，处理时只需要定义形态学类然后进行调用即可，代码都经过调试运行，现在应用与工程项目中

数据挖掘决策树的实现，使用ID3算法编写，本程序是对数据挖掘概念与技术（第三版）中分类算法的实现。主要采用C++ STL（标准模版库）进行编写，运行时需要把samples.txt文件拷贝到C盘根目录下。

一个简单的多线程的例子-a simple example Multithreading

boltzman 模拟退火算法例子-Boltzman simulated annealing algorithm examples

汉诺塔演程序的原代码，可能对兄弟们有用，或者是兴趣爱好！我希望大家可以帮助我这个菜鸟-Tower of Hanoi s original speech program code, may be useful brothers or hobbies! I hope everyone can help me this rookie

矩阵计算，包括了矩阵的加减乘除，还可以实现对角化，对一次解方程组非常有帮助-computing in matrixs,It Includes the plus and multiply and so on,It can realize the diagonalize,that will be very helpfull for one result equation

常用算法的C程序。主要内容包括多项式的计算、复数运算、随机数的产生、矩阵运算、矩阵特征值与特征向量的计算、线性代数方程组的求解、非线性方程与方程组的求解、插值与逼近、数值积分、常微分方程组的求解、数据处理、极值问题的求解、数学变换与滤波、特殊函数的计算、排序和查找。-Commonly used algorithm of C procedures. Include polynomial terms, complex computation, random number generation, matrix operations, matrix eigenvalue and eigenvector calculations, linear algebra equations, nonlinear equations with the equations, interpolation and approximation, numerical integration, solving ordinary differential equations, data processing, for solving extremum problems, mathematical transformation and filtering, the calculation of special functions, sorting and search.

包括了数学数值计算中重要的算法实现，基于类的思想便于调用参考。-Includes the numerical calculation of the important mathematical algorithm, based on the type of thinking of easy reference call.

CKNN  Using the Citation KNN algorithm[1] to get the labels for bags in testBags, where minmum Hausdorff distance is used to measure the distances between bags %     CKNN takes, %        PBags     - an Mx1 cell array where the jth instance of ith positive bag is stored in PBags{i}(j,:) %        NBags     - an Nx1 cell array where the jth instance of ith negative bag is stored in NBags{i}(j,:) %        testBags  - a Kx1 cell array where the jth instance of ith test bag is stored in testBags{i}(j,:) %         Refs     - the number of referecnes for each test bag %        Citers    - the number of citers for each test bag %      &n