资源列表
SortTest
- 几种排序算法及程序说明。包括冒泡排序、选择排序、插入排序、快速排序-Descr iption of several sorting algorithms and procedures. Including bubble sort, selection sort, insertion sort, quick sort
suanfayanshi
- 包含常见算法并用动画演示算法的实现过程，非常适合学习-Contains the common algorithm and the algorithm implementation with the animation process, is very suitable for learning
Balanced-binary-tree
- 手动输入数据，加入到二叉树中，并生成平衡二叉树，对学习C++及数据结构有较大帮助-Manually input data into the binary tree, and generate a balanced binary tree, to learn C++ and data structures have more help
naa
- 用欧拉法，预估校*,四阶R-K法对解初值问题求解，且与精确解比较。-By Euler' s method, predictor corrector method, fourth order RK method for solving initial value problem solutions, and compared with exact solutions.
erchapaixushu
- 二叉排序树的中序遍历（即先访问左子树然后是跟最后是右子树）-Binary sort order traversal of the tree (that is, first and then visit the left subtree is right with the last sub-tree)
5.8
- 二叉排序树中序排列，先创建二叉排序树，后中序排列-Binary sort tree arrangement should first create a binary sort tree, the latter arranged in the order
ant
- aco code aco to problem ant colony -aco code code aco to problem ant colony
DFS_AND_BFS
- 图的深度优先和广度优先算法的实现和比较，自行输入节点顺序，然后使用不同的方式历遍-the implementation and comparison of Graph depth-first and breadth first algorithm
ListManage
- 电话本的链表部分，实现各名片的相互连接，以及他们的顺序关系。-failed to translate
HANOI
- 汉诺塔算法，实现汉诺塔的内部模拟演示，不输出至终端，要显示自行修改代码-Tower of Hanoi algorithm, the Tower of Hanoi' s internal simulation demonstration, not output to the terminal, modify the code to be displayed
Queue-chain-basic-operation
- 实现队列的几个基本操作，基于链式队列存储模式。-Realize several basic operation, platoon based on chain queue storage mode.
BFS_tree
- BFS_tree faoca[ f aofjaandbada