资源列表
seg
- 线段树经典应用，求合并矩形的周长。IOI经典题目Picture。-Classic application of the segment tree, find the perimeter of the rectangle consolidation.
simknap_rec
- 简化背包算法，实用于大学生学习模拟使用，实现简单的背包问题-Simplify the knapsack algorithm, useful in the simulation students learn to use, simple knapsack problem
A
- 根据A*算法实现九宫格重新排序问题，并记录每步的排序结果-Jiugongge A* algorithm based on re-scheduling problem, and record the results of each step of the sort
Fourth-order-Runge---Kutta-
- 四阶龙格-库塔算法在姿态解算中的应用,是实现圆锥运动的姿态解算。当旋转角速率w为定值的时候，我用龙格-库塔算法很容易解出了姿态矩阵四元数。-Fourth order Runge- Kutta algorithm of attitude algorithm.
mid
- 将任意一个已知长度的数列按照一定的顺序进行排序-Arbitrary length sequence of a known sequence in accordance with a certain sort
99
- c语言编写的99乘法表 让初学者了解for的简单应用-c 99 languages for beginners to learn the multiplication table for a simple application
knapsack
- 学习文档，是背包问题的，分享一下，希望对大家有用-Study documents, the problem is the knapsack, and share, we hope to be useful
BFSandDFSList
- 对数据结构中图一部分采用邻接表实现无向图的建立、深度优先遍历和广度优先遍历算法实现，成功运行，有测试数据-Part of the data structure used in the adjacent table to achieve the establishment of an undirected graph, depth-first traversal and breadth-first traversal algorithm, the successful operation, a t
PBFSandDfsList
- 数据结构中对有向图采用邻接表为存储结构实现对有向图的建立、深度优先遍历和广度优先遍历，同样有测试数据-Data structure of a directed graph with adjacency table for the storage structure to achieve the establishment of a directed graph, depth-first traversal and breadth-first traversal, the same test da
uva439-Knight-Moves-
- uva439 Knight Moves的代码，并且在UVaOJ上通过了-uva439 Knight Moves the code, and adopted the UVaOJ
dijkstra
- Dijkstra算法的C语言实现，输入参数包括三部分： 1)图中的节点个数 2)图的权值矩阵，其中，不相邻的两节点间输入较大的数100表示 ； 3)给定源节点，如输入1表示以1节点为源节点；输入2表示以2节点为源节点，依次类推。 -Dijkstra algorithm in C language
BST
- operation on binary search tree like add,delete,