资源列表
Joseph
- 数据结构链表实验的joseph算法。可以实现数据结构练习册上的实验-the Descr iption of Joseph
Merge
- 创建两个非递减顺序的链表，合并到第三个链表中（也是非递减）-To create two non-descending order of the list, merged into a third list in the (also non-decreasing)
heb
- 将两个带头结点的非递减有序单循链表的合并-The two leading nodes of non-decreasing order one through the merger of the list
3
- 大二上册,算法设计技巧与分析这门课程中的矩阵链乘实验-Big volume, algorithm design skills and analysis the course of matrix chain by experiment
MST
- 数据结构：C++语言实现最小生成树的算法。-Data structure: C++ language for minimum spanning tree algorithm.
test
- 此程序在建立栈的时候就按照一定的顺序排列好 -The program in establishing a stack according to certain when the order of good
kuohaoCompare
- 数据结构中的有关栈的操作，进行括号匹配，判断成功与否。-The data structure of the stack operation, matching parentheses, judge success or not.
mobile
- 移动数字排列方阵，随机输入8个数字，将数字按方阵依次序排列-Square mobile digital arrangement, random input eight Numbers, will in turn the phalanx Numbers in descending order
liqueue
- 在Visual C++中实现： 1）创建一循环队列； 2）创建一个顺序栈； 3）利用栈和队列实现回文字符串的判定。 -failed to translate
7
- 实现：平均排序 (k排序) k排序的定义：A[i] <= A[i + k] 即为希尔排序的不完全实现-Implementation: Average sort (k sorting) k sort defined: A [i] < = A [i+ k] is not fully realized Hill sort
shunxubiaodehebing
- 创建两个顺序表，通过指针的方式实现顺序表的合并-Create two order table, through the pointer way to realize the merger of the sequence table
z
- 课程设计，数据结构的关于循环队列，应用为猴子选大王