平衡支架

图论*匈牙利算法 的两种实现过程 Matching的巧妙在于队列的进入退出并没有仅仅限于在同一层循环中做到，构思巧妙 其算法思想在《算法设计与分析基础》上可以参阅-Graph theory* Two Hungarian Algorithm realization process ingenious Matching queue entry and exit is not just limited to the same level as the cycle done, the idea of clever ideas in their algorithm,

最近邻搜索算法，k_tree算法的大部分中文文献-Nearest neighbor search algorithm, k_tree algorithm for most of the Chinese literature

经典算法：旅行商算法，采用爬上法和分支界限搜索-classical algorithm : traveling salesman algorithm, used to climb up and branch Boundary Search

字符串高效匹配算法Sunday，是目前单字符串匹配算法中最为高效的一种。-Efficient string matching algorithm Sunday, is currently the single most efficient string-matching algorithm as a.

用链表实现的大数阶乘，可以计算n万的阶乘，不过3万以上，时间就很长了。-List realize with the factorial of large numbers, can calculate the factorial of n million, but more than 30,000, time is very long.

完全采用指针编写的字符串排序程序，共两种方法，调试过-completely prepared by the string pointer ranking, with a total of two methods tuned

用ado连接数据库access的详细代码（可能还有一些功能有待完善，大家可以互相交流啊）-Database access using ado connection code details (and possibly some of the features remain to be improved, we can exchange ah)

Ora10GSQLReference oracle10gSQL语言参考-Ora10GSQLReference

我只是共享代码 CRUD （创建、 读取、 更新、 删除） 使用 php 和 javascript 的数据，这段代码具有功能输入和显示与不 realoaded 你的页面。还有成附件尚未插入数据库的例子。let 的摇滚 ！

这是我做数据结构课程设计里面的一个设计程序，二叉树排序-This is my curriculum design make the data structure inside a well-designed procedures, binary tree sort