最长公共子串的Java实现和NPL应用

无递归二叉树插入及中序等顺带求得深度等-Non-recursive binary tree insertion sequence, such as passing and seek depth

杭电第一页的100道题，是有简单，有难的哪一种，但是对于初学者来说难度还是比较大，所以我把代码发上来，大家有兴趣，看一看

C#寻找素数 素数寻找问题由来已久，一直是一些数学家追求的目的。-C#-finding prime numbers to find a few long-standing problem, mathematicians have been some of the objective pursued.

用几种规则控制倒立摆的模糊运动的程序-Several rules of fuzzy control of inverted pendulum movement procedures

使用： 首先，输入结点名称，最好以单个字母表示。然后，根据输入的名称顺序，在输入0或1，分别表示点点未连，点点相连。最后任意输入1个已有点的名称，程序开始正常运行。 结果： 以邻接链表的形式展示已输入的图，同时给出关节点的名称，或关节点不存在

Numerical Anaysis 8th Edition Burden and Faires

数值计算算法,BreshamLine画线算法,数值计算实验,比较简单-numerical algorithm, BreshamLine line drawing algorithms, numerical experiments, relatively simple

适用于初学者的C#源代码，教你学会画点画线和画面，并且能判断点与折线以及点与多边形的位置关系。代码清晰易懂，重点处附有注释。

对任意给定的二叉树（顶点数自定）建立它的二叉链表存贮结构，并利用栈的五种基本运算（置空栈、进栈、出栈、取栈顶元素、判栈空）实现二叉树的先序、中序、后序三种周游，输出三种周游的结果。- To wilfully assigns two forks the tree (to go against points from to decide) establishes it two to fork the chain table storage structure, and (sets at spatial stack after the stack five kind of fundamental operations, enters stack, sends out of the warehouse, takes stack top element, sentences stack to be spatial) realizes two forks the tree first the foreword, center the foreword, the foreword three kinds travels around, outputs the result which three kinds travels around.

数据结构，用链栈来实现各进制间的相互转换。-Data structure, with chains stack to the achievement of the inter-binary conversion.