资源列表
公共子序列
- 本算法实现的是对两个单字符串的扫描，找出其最长公共子序列。-the algorithm to achieve the two-string scan, identify its longest public sequences.
TwoEmbranchmentTree
- TwoEmbranchmentTree:As ancestor has its children , a tree has its leaves. we could check its leaves in terms of algorithm as preorder , midorder or postorder.-TwoEmbranchmentTree : As ancestor has its children, a tree has its leaves. we could check
gaoji
- 系统应实现的操作及其功能定义如下： 1）采编入库：新购入一种书，经分类和确定书号之后登记到图书账目中。如果这种书在账目中，则只将总库存量增加。 2）清除库存：某种书已无保留价值，将它从图书账目中注销。 3）借阅：如果某种书的库存量大于0，则借出一本，登记借阅者的图书证号和归还期限。 4）归还：注销对借阅者的登记，改变该书的现存量。 -system should achieve the operation and function are defined as foll
wtree
- 这是数据结构中的二叉树遍历和输出叶子的数量,传上来大家互相学习,大家共同进步
nqueen
- N皇后问题（c语言版），N默认为8，N值可以进行修改
Chessman
- 分治法经典问题，棋子移动问题，在规定的规则内移动棋子。-Classic problem of sub-rule law, chess mobile issues, the rules in the pawn move.
zuiduanlujing
- 介绍图的最短路径的算法，在VC环境下运行过，简单实用-Plans to introduce the shortest path algorithm, running in the VC environment, the simple and practical
MSort
- Implementation of Merge sort
Lab_1.2
- dda算法 的最新实现 用于华工学生的良好资料 -dda algorithm is the latest achievement for the Chinese laborers in students good information on the latest achievement dda algorithm for Chinese laborers in students good information on
zuixiaoshengchengshu
- 用Kruskal算法求最小生成树，n个城市架设N—1条通讯网络-For the Minimum Spanning Tree with Kruskal, n cities set up communication network N-1 条
Hilldirectlyprocess
- 实现希尔排序理解希尔排序的过程以及直接插入排序-Hill, Hill sort order to achieve understanding of the process and direct insertion sort
ListInsert_sq
- C/C++实现在顺序存储结构下对线性表进行插入元素、删除元素、合并等各种操作。结构清晰，有注释。-C/C++ realization of the storage structure in order to insert the table under the linear elements, delete elements, merging and other operations. Clear structure, with comments.