（本文是在论坛已有一篇文章《SIRP法相干相关K分布雷达杂波的建模与仿真》的基础上修改而来，在此首先感谢这篇文章的作者给予我的帮助。之所以完成这篇文章，有三个方...

用设计的词法分析器，还是比较好用的。所以上传给大家。-design with the lexical analyzer, or better quality. So you upload to.

多项式的计算问题，这个小程序实现了多项式的求和的计算，输入系数和次数，并以-1 -1 结束-Polynomial computational problems, this small program enables the calculation of polynomial derivation, input coefficients and the frequency and to the end of-1-1

迷宫问题的算法,用c实现的-maze of algorithm, with the realization c

pku解题，以及一些常用的技巧， 求插座的数目-pku evaluations, as well as some commonly used techniques, the number of outlets for

用C++ Builder编写得菜单工具栏得程序，希望对大家有帮助-C++ Builder with a menu to prepare a program toolbar, I hope all of you help

俄罗斯方块源代码，很实用的，很完整，初开发游戏的的人很有帮助-block game, vc++ programme .

矩阵导致小程序，对输入的矩阵求倒置后的矩阵-Matrix led to a small program, the input of the matrix after the matrix inversion

一个可以提供初学者学习Access的教程,很有用的-can provide beginners a learning Access Guide, very useful

embest的嵌入式开发环境,非常好用,是进行arm开发的必备工具-embest embedded development environment, very easy to use, is an indispensable tool for the development arm

平衡二叉树操作的演示 一、 需求分析 （1） 利用平衡二叉树实现动态查找表。实现查找，插入和删除三种基本功能。 （2） 初始，平衡二叉树为空树，操作界面给出查找，插入和删除三种操供选择。每种操作均要提示输入关键字。每次插入和删除一个接点时，显示更新的平衡二叉树。 （3） 重点在于对删除算法的实现。假设要删除的关键字为X的结点，若X不在叶子结点上，则用左子树中的最大值或者右子树中的最小值取代X。如此反复，直到删除动作传递到某个叶子结点，删除叶子结点时，若要进行平衡变换，可采用插入的平衡变换反变换。 -balanced binary tree operation of a demonstration, demand analysis (1) using a balanced binary tree dynamic lookup table. Lookup, insertion and deletion of the three basic functions. (2) The initial, balanced binary tree is empty tree interface gives you insert and delete options for the three parade. Each operation will have to be me to input keywords. Each insert and delete a contact in that update balanced binary tree. (3), the focus is on the deletion algorithm. To remove the assumption that the keyword for the X-Node, if X is not the leaf nodes, Left-used for the highest tree or right-tree to replace the minimum X. So repeatedly, until the deletion of a transfer leaf nodes, delete the leaf nodes, if balancing transform, Ins