资源列表
backpack
- 动态规划实现0-1背包问题和贪心法实现背包问题-Dynamic programming to realize knapsack problem and greedy method to realize knapsack problem
redblack
- 标准数据结构红黑树的C语言实现，很规范，供参考-The standard C language data structure of red-black tree implementation specifications for reference
Poly
- 数据结构中，使用线性表实现的关于多项式的实现，实现了多项式的一般运算功能-The data structure, using a linear table implementations on polynomial achieve polynomial general arithmetic function
tree
- 二叉树的建立和先序递归遍历、中序递归遍历后序递归遍历并用递归算法求二叉树的叶子节点的个数-The number of recursive traversal sequence after the establishment of a binary tree and recursive preorder traversal, inorder recursive traversal and recursive algorithm and binary tree leaf node
2
- 建立图的邻接表DFS：深度优先遍历的递归算法 BFS：广度优先遍历-Establish the adjacency table DFS: depth-first traversal of the recursive algorithm BFS: breadth-first traversal
treap
- treap代码，pascal实现，信息学竞赛必备-treap code, pascal achieved informatics contest essential
queue
- 标准数据结构queue的c源码实现，非常规范，仅供参考-C source code to achieve the standard data structure queue
middle-num
- 一个求中位数 算法复杂度为0（n）的小程序-get middle number which time is 0（n）
normalc
- 程序是主合区和主吸取的代码。用真值表做的，程序简单易懂，包含丰富的注释。有详细的结果分析。-The program is the main co-code area and the main lessons. To do with the truth table, the program is simple and easy to understand, contains a wealth of annotation. Detailed analysis of the results.
myvc6
- 线性链表操作，可以删除、添加、显示、查询等功能-Linear list operations, you can delete, add, display, query and other functions
Path
- 使用顺序队列求迷宫的最短路径。move[]数组四个方向的试探，第一行输入的数据表示迷宫的数据规模n（1<n<=20）行m（1<m<=20）列，S是出发点，D是迷宫的出口，.号表示通路，X表示墙体不通，输出的数据表示从入口到出口最少需要走k步或没有通路-Use the order of the queue and maze shortest path. move [] array of four directions of temptation, the first lin
gaussseidel-and-sor
- Gaussseidel程序和sor程序，用于数值代数算法之中。-Gaussseidel sor