KMP

有理数的算法，包括其加减乘除，启用的是单链表的形式来表达(Rational algorithms, including addition, subtraction, enabling a single-chain form of expression)

说明：  数据结构实验报告链表的操作，包括创建空链表、插入、删除节点等(Experimental Report list data structure operations, including creating an empty list, insert, delete nodes, etc.)

二叉树的先序遍历。采用递归实现。释放资源时用了后序遍历。(Preorder traversal of a binary tree. Recursive implementation. Release resources used after preorder.)

归并排序,复习排序算法，在不同环境下，寻找时间复杂度最少的排序算法( Merge sort, review sorting algorithm, in different contexts, looking for the least time complexity of sorting algorithm)

在Visual Studio 2008运行成功 数据结构 二叉查找树的类(In Visual Studio 2008 running a successful binary search tree data structure classes)

快速排序，用数组的存储结构，实现数的排序。共有八组随机数据，还能够计算出每组数据的处理时间，最终得到平均时间。(Quicksort array storage structure, to achieve the sort of number. A total of eight sets of random data, but also be able to calculate the processing time of each data, and eventually obtain the average time.)

最小生成树算法 克鲁斯法尔算法 球最佳路径(kulru method class maiun void cx )

大学计算机专业，数据结构中的改进的KMP算法，C++编写。(University computer science, data structures to improve the KMP algorithm, C++ written.)

This is a C++ code. It finds out if the tree is a binary search tree (BST)or not, where the BST is one of data structures types.

穷举算法，VC中的经典程序之一，适合初学者，(Brute-force algorithm, the the of the classic procedures in in the the VC, suitable for beginners)