sort

堆栈实现C++,以VC++环境为准——逍遥大洋至上(The stack of the C++, VC++ environment will prevail)

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

这是一个二叉树的工程文件，包括了工程文件里的所有文件。以及二叉树的构建，traverse，搜索等功能函数。(This file contains a summary of what you will find in each of the files that make up your bTree application. )

最大堆排序算法，C++语言编写,原程序，算法导论(The maximum heap sort algorithm, C++ language)

利用二叉平衡树进行数据排序。这里采用的数据结构是指针。(The use of balanced binary tree sort the data. The data structure used here is a pointer.)

数据结构中的用kmp算法查找关键字，供初学者参考(Data structure using kmp algorithm to find the keyword reference for beginners)

PKU ONLINEJUDGE 2371

冒泡优化： 如果一个序列是int n[]={1,2,3,4,5,6,7,8,9} , 用正常的冒泡排序需要排8次才行，优化之后1次就好，也就是说序列越接近于正常序列，改进之后的冒泡排序的次数就越少，这样会给一个冒泡排序算法带了很大的效率。 思想：添加一个boolean变量用来判断冒泡是否是已经排好了顺序，如果boolean的值为false，说明是已经排好了，如果boolean的值true，说明没有排好，继续排。(If a sequence is int n [] = {, 1,2,3,4,5,6,7,8,9} need to row 8 times the job after optimization times like normal bubble sort, but alsomeans that the sequence is more close to the normal sequence, improved bubble sort, the less the number, which would give a bubble sort algorithm with a great deal of efficiency. Idea: add a boolean variable used to determine the bubble whether it is already lined up the order, if the boolean is false, indicating already lined up, if the boolean value of true, did not line up, continue to row.)

表达式cpp实现 数据结构实验源代码 实现前序、中序、后序表达式(Expression codes Formerorder expressions regular expression&Postorder expressions )

多项式加减乘 用数据节够得算法实现多项式的加减乘 原理简单易懂(suoxiangshi jiajiancheng)