-
migong
迷宫问题，利用随机数自动生成迷宫，并自动进行探索。迷宫起点及终点由用户自己设定。(Maze problem, the use of random number automatically generated maze, and automatically explore. The starting point and end point of the maze is set by the user.
双语对照
)
- 2021-04-26 16:48:45下载
- 积分：1
-
tu
说明： 、实验目的
1 熟练掌握各种内排序方法，深刻理解排序算法及其执行过程；
2 学会分析各种内排序算法的性能；
3 了解各种排序方法的优缺点，对于实际问题能够选择一种较好的排序方案；
4 熟练掌握图的存储结构；
5 掌握图的邻接矩阵和邻接表表示分别进行深度和广度优先搜索遍历的算法。
6 了解图的最小生成树算法。
(Proficiency in the order of search, binary search and index search basic search algorithm, these algorithms are familiar with what kind of storage structure suitable for implementation two master binary sort tree characteristics, building methods, and dynamic search algorithm 3 master hash table of characteristics and construction methods.)
- 2009-12-30 21:15:29下载
- 积分：1
-
fast_sort
/*快速排序：以待排序元素中的第一个元素作为基准将带排序的元素分为三组
*大于基准元素为一组置于基准值的右边，小于基准值的元素为一组置于基准值的左边，
*基准值为一组，这样就找到了基准元素的位置就确定了
*如此递归调用。直到每一组的low==high，即实现了排序的要求。
*/
(/* Rapid Sort: the first element to be sorted in the element as a basis with with sorting the elements are divided into three groups* is greater than the reference element of a group is placed on the right side of the reference value, smaller than the reference value elements for a group of placed on the left side of the reference value,* reference value, a group, so that the location of the reference element is found it is determined* so recursive call. Until each group of low == high to achieve the requirements of the sort.* /)
- 2012-10-26 21:42:43下载
- 积分：1
-
BinarySortTree
二叉排序树，可以实现插入，删除，查找，创建功能(Binary sort tree,you can achieve the insert,delete,search,create functional)
- 2009-12-03 10:53:04下载
- 积分：1
-
257
几个比较好的初级算法，初学者可以看一下思想，对算法入门(A few good elementary algorithms, beginners can look at thinking on algorithms entry)
- 2013-06-16 14:38:40下载
- 积分：1
-
FIFO-c
说明： 操作系统先来先服务调度算法模拟（C描述）(Operating a first-come first-served scheduling simulation (C description))
- 2010-04-13 00:02:35下载
- 积分：1
-
Graph
数据结构中图的遍历Data structure traversal of center(Data structure traversal of center)
- 2013-11-28 10:53:29下载
- 积分：1
-
heap
实现栈的基本操作，建栈，进栈，出栈，数据结构实现(To achieve the basic operation of the stack, built stack into the stack, the stack data structure)
- 2013-04-03 11:08:37下载
- 积分：1
-
fibonaqi
说明： 斐波那契 式子计算，属于算法类的
用于VC6.0++(Fibonacci calculation formulas, algorithms are used to VC6.0++ class)
- 2011-04-07 09:10:16下载
- 积分：1
-
FreeTree
无环连通图G=(V, E)亦称为自由树T，其直径是树中所有顶点之间最短路径的最大值，设计一个算法求T的直径(Acyclic connected graph G = (V, E) is also known as free tree T, whose diameter is the tree of shortest paths between all vertices maximum design an algorithm for the diameter of T)
- 2013-10-29 16:31:47下载
- 积分：1
