资源列表
2
- 输入十个1至100的数，统计特定数出现的次数,-1-100 10 enter the number of statistics the number of a specific number of emerging,
6.1
- 实现非递归二叉排序树的插入和创建,并用中序遍历检验-To achieve non-recursive binary tree insertion sort and create and use in order traversal test
bag2
- 背包问题有很多解决算法，这里使用贪心算法解决背包问题-There are many algorithms to solve knapsack problem, greedy algorithm is used here to solve knapsack problem
lab4.2
- 数据结构中矩阵相乘的具体实现，输入请按矩阵方式输入-Data structure in the concrete realization of matrix multiplication, the input mode, press the input matrix
TDIJKSTRAAsh
- 这是一个求最短路的算法，用DIIJKSTRA的方法可直接使用。 -This is a request to the shortest path algorithm, DIIJKSTRA the method can be used directly.
bintree_inorder_rec
- 实现二叉树对称根周游的递归计算，按先根次序周游的顺序输入结点的信息,生成一个双链存储的二叉树的过程-Binary tree symmetric recursive computation of the root of traveling around the first root of the order of traveling around the order of input nodes, to generate a double-stranded storage of the binar
source
- 求6000以内的阿姆斯特朗数，测试过 oK-Demand within a few Armstrong 6000, tested oK
btree
- 一个简单的二叉树，包含二叉树的先序后序中序遍历，交换左右子树。-A simple two binary tree traversal, contains two binary tree preorder postorder, exchange of left and right subtree.
zoj_1009_Enigma
- 这是一道模拟题目，属于比较容易的，但是其中用到了一个类似于循环队列的东西，感到还是很有意思的-This is a simulation of the subject, are relatively easy, but the cycle is similar to using a queue of things are still very interesting
stackProblem
- 车厢调度问题，用数据结构的栈来实现车厢调度-Train scheduling problem, using the data structure inside the stack to implement scheduling
labyrinth
- 迷宫问题c源代码，大小为8*8的迷宫。主函数中输入开始位置和结束位置的坐标，输出所有可能的路径-Maze c source code, size 8* 8 of the maze. Enter the start the main function of the coordinates of the position and end position, the output of all possible paths
BUBBLE-SORT
- BUBBLE SORT ALGORITHM USING C LANGUGE