deep-copy

自己编写的floyd 最短距离求解程序。实用简单。gcc (Floyd shortest distance to write your own solver. Practical and simple. gcc)

数据结构中KMP算法c语言实现，vc6.0环境(KMP algorithm in c language data structure, vc6.0 environment)

数据结构线性表教学笔记，内容讲基础知识，没基础可以看看(Linear table data structure teaching notes, basic knowledge content says, no base can take a look)

数据结构学习中提供的不错的源码，一个哈夫曼树类，利用了链队列存储结构。压缩包中有七个文件。(Data structure provided a good learning source, a Huffman tree class, the use of the chain queue storage structure. There are seven compressed file.)

数据结构中图的遍历Data structure traversal of center(Data structure traversal of center)

最优二叉搜索树问题具有最优子结构性质，即其任意一棵子树都是一棵独立的最优二叉搜索树，所以可以采用动态规划方法，并且在每次更新时保存子树的根。(Optimal binary search tree problem has optimal substructure property that any of its sub-tree are an independent optimal binary search tree, so you can use dynamic programming methods, and save each update subtree roots.)

NTL应用——大数系数多项式乘法的计算。从文件读如参数，计算多项式相乘后某项的系数(NTL application- the multiplication of big numbers coefficient polynomial )

简单的一个链栈.即用链表实现的一个栈。可以做简单的插入、删除、查找等操作(this is a simple C++ program )

C++中，对链表的增删改查的基本使用，值得学习(C++, on the list of CRUD basic use, it is worth learning)

说明：  操作系统先来先服务调度算法模拟（C描述）(Operating a first-come first-served scheduling simulation (C description))