对任意给定的二叉树（顶点数自定）建立它的二叉链表存贮结构，并利用栈的五种基本运算（置空栈、进栈、出栈、取栈顶元素、判栈空）实现二叉树的先序、中序、后序三种周游，

利用opencv  写的摄像头视频采集测试程序，可以从摄像头采集图片或者视频。可进一步通过opecnv 对采集内容进行编辑。

简单的小程序 就是用jacobi迭代来算线性方程组的解 见笑见笑-Simple procedure is used to count jacobi iterative solution of linear equations laughing stock of the laughing stock of the

约瑟夫环的c语言算法-Josephus c language algorithm

用汇编语言实现的PN码，长度为9。。只需要8个cycle就可以出32bit。。效率很高。。和大家一起共享：）-using assembly language to achieve the PN code, the length of nine. . Only eight cycle will be 32 bit. . High efficiency. . And together we share :)

计算超短脉冲非线性传输的一个比较成熟的M文件-Calculation of nonlinear transmission of ultrashort pulse of a more mature M documents

一个简单的计算器功能 真的 让你了解他 你难道不相信吗 -A simple calculator function allows you to really know Do not you believe it

通常MCIL假设一个包中的实例是独立分布的，不考虑实例间的内部依赖关系，但是这样，如果属于正的实例是噪声，则会有误差，所以考虑上下文关系（邻居点），增强MCIL的鲁棒性。将聚类的概念引入到多示例学习中 完成图像的分割和聚类。

逐次超松驰迭代法(Successive Over Relaxation Me thod,简称SOR方法)是高斯―塞德尔方法的一种加速方法，是解大型稀疏矩阵方程组的有效方法之一，它具有计算公式简单，程序设计容易,占用计算机内存较少等优点,但需要较好的加速因子(即最佳松驰因子).下面我们首先说说松驰一词的含意,再利用它来解释雅可比迭代法与高斯―塞德尔迭代法,最后给出逐次超松驰迭代法的推算公式和收敛性条件.-Successive over relaxation iteration method (Successive Over Relaxation Me thod, called SOR method) is the Gauss- Seidel method for an accelerated method is solution of large sparse matrix equations, one effective method, it has a simple formula, programming easy, take up less computer memory, etc., but the need for better acceleration factor (that is, the best relaxation factor). Let us first talk about the meaning of the term relaxation, and then use it to explain the Jacobi s iterative method and the Gauss- Seidel iterative method, and finally gives successive over relaxation iterative method of projection formula and the convergence condition.

不错的SVM实现算法，采用的是LS-SVM算法，这是MATLAB版本，还有一个C版本-good SVM algorithm, using the LS-SVM, which is MATLAB version, a C version