采用c++编写,上机运行通过的N皇后实现代码,绝对可用

此算法是在VS中实现的二叉遍历算法，二叉树的基本的遍历规则有三种：前序遍历，中序遍历和后序遍历。对于每一种遍历，树中每个结点都要经过3次。前序遍历在第一次遇到结点时立即访问，中序遍历第二次遇到结点时访问，后序遍历则到第三次遇到结点时才访问。

在powerbuilder 7.0中实现md5的算法，下载后直接导入到pbl库文件中，即可使用。-in powerbuilder 7.0 achieving md5 algorithm downloaded directly into the pbl the document can be used.

算术表达式求值的程序，用栈实现的，可以进行加、减、乘、除、乘方、求余计算，支持小数和括号 （数据结构作业）-arithmetic expression evaluates the procedures used stack to achieve, and can be, plus or minus, multiplication, addition, the involution, for I, support minority and brackets (data structure operations)

数值分析插值算法-numerical analysis interpolation algorithm

计算机图形学，Douglas曲线拟合，Delphi源码，值得学习。-Computer Graphics, Douglas curve fitting, Delphi source code, it is worth learning.

LCS算法以c#来实现，对于学习算法的人可以用这个程序看看，演示是基于VS2005开发的。

与上一个程序的不同之处在于，此程序计算的是强制对流的问题，上一个为自然对流-With a different procedure is that this procedure is the calculation of the problem of forced convection, natural convection on a

一个自己写的列主元高斯消去法，用Matlab实现-Wrote it myself out of a PCA Gaussian elimination, using Matlab realize

一个Huffman的例子--A Huffman example

A program to find frequent itemsets (also closed and maximal) with the eclat algorithm ,which carries out a depth first search on the subset lattice and determines the support of itemsets by intersecting transaction lists. -A program to find frequent itemsets (also c losed and maximal) with the eclat algorithm, which carries out a depth first search on the sub set lattice and determines the support of items ets by intersecting transaction lists.