资源列表
qtree
- 关于SPOJ 中的qtree问题的一类解法和深入思考-About the qtree problem s solution and in-depth reflection
wyj
- 动态分区分配方式模拟：了解动态分区分配方式中使用数据结构和分配算法-Simulate the dynamic partition
matrix
- matrix multiply and sum
chongyanshi
- 实现数据结构中的重言式功能。通过此cpp文件中的方法实现。-Data structure tautologies function. Cpp file through this method of implementation.
cfile
- 一些c语言的精巧算法和技巧. 包括最短路径,快速排序等经典算法值得一看-good
Maze
- 用非递归思想实现“迷宫”经典问题的算法，运用了堆栈的方法-To achieve a non-recursive thinking, " Maze" problem algorithm
CLOSESTPAIR
- 最近点对问题，求解平面上n个点的集合中距离最近的两点的距离。-Nearest point of the problem, solving the plane the set of n points in the distance between the nearest two points.
knapsack
- 背包问题，每类物品个数不限，使得总价值最大的动态规划算法。-Knapsack problem, the number of each type of goods not limited to, making the total value of the largest dynamic programming algorithm.
matrix
- A program for two dynamic matrix multipliccation
bfs
- Breadth First Search (BFS) algorithm implementation
3.17
- 王晓东 算法分析与设计 算法实现题3-17-Wang Xiaodong Algorithm Analysis and Design Algorithm Questions 3-17
xians
- 线索二叉树的应用，实现线索二叉树的建立、插入、删除、恢复线索-Threaded Binary Tree applications, to achieve the establishment of a binary tree leads, insert, delete and restore thread