用回溯方法写的01背包问题，有中文注释，很容易懂！-Methods used to write back the 01 knapsack problem, a Chinese note, it is easy to understand!

哈夫曼树又称最优二叉树，是一种带权路径长度最短的二叉树。所谓树的带权路径长度，就是树中所有的叶结点的权值乘上其到根结点的路径长度（若根结点为0层，叶结点到根结点的路径长度为叶结点的层数）。树的带权路径长度记为WPL=(W1*L1+W2*L2+W3*L3+...+Wn*Ln)，N个权值Wi(i=1,2,...n)构成一棵有N个叶结点的二叉树，相应的叶结点的路径长度为Li(i=1,2,...n)。可以证明哈夫曼树的WPL是最小的。

高性能计算高斯消去解方程组c++程序（复杂度 n^3-high-performance computing solutions Gaussian Elimination equations c (n ^ complex 3

快速傅立叶变换的实现算法。包括1维FFT、2维FFT及其逆变换，以及离散变换的相关源码。-Fast Fourier Transform algorithm. Including the one-dimensional FFT, 2-dimensional FFT and its inverse transform, as well as the related discrete transform source code.

多维傅里叶变换，二维DFT快速算法，共分五部--二：二维复序列行列算法-Multi-dimensional Fourier transform, fast algorithm for two-dimensional DFT is divided into 5- 2: two-dimensional complex sequence algorithm ranks

使用VisualC++实现的伪逆矩阵的计算方法，Dlg编程。-Using VisualC++ implementation of the pseudo-inverse matrix method of calculation, Dlg programming.

采用libtommath大数库对中国剩余定理算法通解进行改写，支持128位的大数实现，已测试成功。

用于Vibe算法的理解 运用 改进 对呀刚接触Vibe算法的同学 有很大的帮助，望大家借鉴 采纳                                                       谢谢

Displays a rotatable and scaleable wire frame of any 3D mathematical function. This can be made up from the normal VB maths plus inverse and hyperbolic functions. Functions can be created and saved as wanted. Image vertices can also be saved for use elsewhere. The MS ScriptControl Eval function simplifies calculations enormously and its use is demonstrated. Also shown are MoveToEx, LineTo which are much faster than the VB equivalents and very easy to use. Included are a set of string handling subroutines such as count characters, squeeze out spaces, replace sub-strings etc. Commented throughout including the 3D maths and perspective methods. All the files are visible and the program is written for an 800x600 screen.

不同版本的ＶＯＦ程序　《运动界面追踪数值模拟方法》-Different VOF programs, thet are abtained from the book by Liu Ru Xun.