资源列表
PA4C
- 在1<=n<=10000000个32位整数中选出最小的k个，输出依次为从大到小的最小的k个数字。计算时间2s内，内存使用小于12M。-In the 1 < = n < = 10000000 32-bit integers in a selected minimum k, the output in descending order of the minimum k digits. Calculating time 2s, memory usage is less than 1
EX14
- 设置一个静态堆栈，编写它的基本操作后，在图类型设计时，构造一个最短路径矩阵和一个最短路径长度矩阵，使用FLOYD算法得出最短路径后，利用堆栈的性质输出最短路径和最短路径长度-Set up a static stack, the preparation of its basic operation, the type of design in the plan, construct a shortest path matrix and a shortest path length matrix,
shunxuxunhuan
- 顺序循环队列基本操作 任意输入队列长度和队列中的元素值，构造一个队列，对其进行清空、插入新元素、返回队头元素以及删除队头元素操作。-Basic operation of the order of any circular queue length and queue input queue element values, construct a queue, its empty, insert a new element to the first team to return the fir
binary-tree
- 1、参考P66建立二叉树的算法，建立图4-13（a）所示二叉树； 2、实现对该二叉树的先、中、后序遍历并输出遍历序列； 3、实现该二叉树的中序遍历非递归算法； 4、实现对该二叉树交换其左右子女的算法。 -1, reference P66 build binary tree algorithm, the establishment of Figure 4-13 (a) shows the binary tree 2, to achieve the binary
mi
- 控制迷宫，输迷宫的矩阵，输入从第几行开始，从第几行结束-Control of the maze, the maze of transmission matrix, enter the first few lines from the beginning, the first few lines from the end of
san-yuan-zu-biaoshi-xishujuzhen
- 三元组表示稀疏矩阵。数据结构课程作业，注释完全，简单易懂，调试通过。-Triples represent sparse matrix. Data structure course assignments, notes completely, easy to understand, debug through.
fasttrans
- 键盘任意输入一个稀疏矩阵A(m*n)，采用三元组存储方法求其转置矩阵B（n*m），并用快速转置算法实现该操作。-keyboard indiscriminate importation of a sparse matrix A (n * m), using triple storage switch for its own matrix B (n * m), and fast algorithm home to the operation.
Queens
- 皇后问题:计算各种情况下的棋盘上皇后的摆放位置-Queen s problems: calculation of a variety of situations on the board the location of Queen s
Exp21_3
- *编写求二叉树的叶子结点数的函数模板.求一棵二叉树的叶子结点数的递归模型如下-* Write a binary tree of leaf nodes seek the function template. Seek a binary tree of leaf nodes as a recursive model
shu
- 生成树病并出它的前序、中序、后序遍历 在判断平衡二叉树-Spanning tree disease and a pre-order it, in order, after traversing a binary tree in determining the balance
shunxubiao
- 在C平台上建立一个简单的顺序表，并对其进行操作-C platform in order to create a simple table, and its operation
majo
- 给定含有n 个元素的多重集合S = {a1, a2,., an } ，1 ≤ ai ≤ n ，1 ≤ i ≤ n ，每个元素在S 中出现的次数称为该元素的重数。多重集S 中重数大于n/2 的元素称为主元素。例如，S={2，2，4，2，1，2，5，2，2，8}。多重集S 的主元素是2，其重数为6。-Given n elements containing multiple collection S = (a1, a2,., An), 1 ≤ ai ≤ n, 1 ≤ i ≤ n, each eleme