资源列表
JOSEPHUS
- 约色夫问题,数据结构实习,用链表实现,哈哈,请多指教,我是才鸟-husband about color, data structure internship with Chain realized Haha, please enlighten, I only birds
My8Queen
- 八皇后问题：用回溯算法做的 -8 Queens : The backtracking algorithm
1008
- poj1008代码，尽量压缩的长度，与大家交流一下。
2
- 输入十个1至100的数，统计特定数出现的次数,-1-100 10 enter the number of statistics the number of a specific number of emerging,
bpbandstop
- 老师布置的一个project，里面有题目和源程序，能够识别十个数字。-Teacher arranged a project, which has subject and source, can identify 10 figures.
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.