资源列表
KMPandmax_match
- 1,KMP:实现了在一个字符串中查找字串的高效算法，复杂度为O（m+n） 2，max_match：求两个字符串的最大匹配字串 在vc6.0中调试通过，可以使用-1, KMP: realized in a string to find String efficient algorithm complexity is O (m+ n) 2, max_match: seeking two strings maximum matching string in the vc6.0 debug en
best_service
- 针对最佳服务次序问题，设置更有效的排序算法，来实现最佳服务次序问题。-Order problem for the best service, set more effective sorting algorithm to achieve the best service order issues.
radixsort
- 内排序，数据结构的一种排序方式，内排序的过程是一个逐步扩大记录的有序序列的过程-Of sorting, a sort of data structure, and gradually expand the orderly sequence length record
phone-num
- 通过电话号码的训练 尽量掌握单链表的有关运用-Training as much as possible by phone number linked to the use of a single master
duilie
- 可以输出队列中的当前元素，还可以对队列判空，进行入队和出队-Can output the current element in the queue, can also be sentenced to empty the queue, enqueue and dequeue
The-application-stack
- 栈的运用，构建空顺序栈，取栈顶元素，入栈，出栈，栈顶元素与当前运算符优先级比较，判断是否为运算符-The use of the stack, in order to build an empty stack, take the top element, stack, stack, stack element with the current operator precedence compared to determine whether the operator
ALL_LCS
- 找出所有符合条件的的最长公共子序列，应用C++编写-To identify all eligible longest common subsequence, application C++ to prepare
template
- 单链表类及其实现设计单链表类， 实现构造、析构、插入、删除等基本的成员函数，并添加将单链表逆置、搜索值为x的成员函数-Design and realization of single-class single-linked list class that implements constructed, destructors, insert, delete, member of the basic functions, and add to the list against a single
6-48
- 构造任意k元（k≥2）Huffman树算法,k元哈夫曼树的构造与2元哈夫曼树的构造相同，差别只在于k元哈夫曼树需考虑虚设的0的个数。-Construct an arbitrary k-ary (k ≥ 2) Huffman tree algorithm, k element of the Huffman tree structure with two yuan the same Huffman tree structure, the difference lies in k-ary Huffma
jiandanxuanze
- 简单选择排序算法是数据结构中关于排序的重要算法，本程序是简单选择排序算法的源代码。-Simply select the sorting algorithm is the sort algorithm, data structures, this program is the source code of a simple selection sort algorithm.
bellman-ford2
- 用bellman ford算法求最短路径，并且输出最短路径的节点，输入有语言提示-Bellman ford algorithm for the shortest path and the output node of the shortest path, enter the language prompts
huanxingduilie
- 环形队列，font队头，rear队尾，font=rear为队满条件-Circular queue font team head, rear end of the queue, font = rear for the team full conditions