-
8sort_method
随机函数产生10000个随机数,用快速排序、直接插入排序、冒泡排序、选择排序的排序方法排序,并统计每一种排序所花费的排序时间和交换次数。其中随机数的个数由用户定义,系统产生随机数。(Random function generates 10,000 random numbers using quick sort, insertion sort, bubble sort, select Sort sort Sort, and statistics for each sort spend the sort of time and the number of exchanges. Wherein the number of the random number defined by the user, the system generates random numbers.)
- 2013-02-27 17:27:04下载
- 积分:1
-
017
广度优先搜索及深度优先搜索,用C语言实现,比较使用(Breadth-first search and depth first search, using C language, compared with)
- 2011-07-09 15:27:40下载
- 积分:1
-
yongzhanshixianleicaozuo
自己做的一个用用栈实现类的操作,是课内作业,希望和大家互相交流(Own a type used by the realization of the operation of the stack is class work, hope and we can exchange ideas)
- 2007-12-25 22:28:05下载
- 积分:1
-
xuanzexingjiegou
选择型结构c语言编程 (Choose the type of structure of C language programming)
- 2013-09-24 22:11:37下载
- 积分:1
-
structure-array-code
根据队列搜索算法的基本思想,现设计了一个简单的结构体数组如下定义代码所示。此结构体数组具备控制结点搜索和存储结点信息和路径的功能,可以较好的实现TDN的最小时间路径搜索。(Search algorithm based on the basic idea of the queue is now designed a simple structure array as defined code. This structure array with the control node and storage node information search and path functions, you can achieve better TDN minimum time path search.)
- 2013-10-09 14:35:43下载
- 积分:1
-
Figure-topological-sort
说明: 拓扑排序
对一个 有向无环图 G进行拓扑排序,是将G中所有顶点排成一个线性序列,使得图中任
意一对顶点u和v,若u,v ∈E,则u在线性序列中出现在v之前。
通常,这样的线性序列称为满足拓扑次序的序列,简称 拓扑序列 。
注意:
①若将图中顶点按拓扑次序排成一行,则图中所有的有向边均是从左指向右的。
②若图中存在有向环,则不可能使顶点满足拓扑次序。
③一个DAG的拓扑序列通常表示某种方案切实可行。 (Topological sort
In a directed acyclic graph G topological sort, is all vertices will G formed a linear sequence, make diagram post
Meaning a pair of vertex u and v, if u, v ∈ E, then u in linear sequence in which they appear in v before.
Usually, such linear sequence sequence of topological order called meet, abbreviation topology sequence.
Note:
(1) if the diagram according to the topology order line vertices, then figure all from left to right edge are pointing.
(2) if the figure to exist in the ring, is impossible to have the vertex meet topological sequence.
(3) a DAG topological sequence usually expressed some scheme is feasible.
)
- 2011-03-22 17:19:14下载
- 积分:1
-
xiererfenchazhao
希尔排序c++数据结构算法
二分查找的递归算法(希尔排序c++数据结构算法
二分查找的递归算法
)
- 2010-12-10 18:32:52下载
- 积分:1
-
0829-Binary-Tree
二叉搜索树的生成和查找节点,北大《数据结构与算法》教材的习题(The generation and find nodes of a binary search tree, Peking University, " Data Structures and Algorithms" textbook exercises)
- 2012-11-28 14:51:01下载
- 积分:1
-
zuixiaoshengchengshu
最小生成树C语言程序,提供给喜欢编程以及数学建模的同学(Minimum spanning tree C language program)
- 2015-02-08 20:15:45下载
- 积分:1
-
data-struct
对于数据结构每一章节的相应的练习题,巩固好数据结构(To consolidate data structure corresponding practice questions for each chapter of the data structure)
- 2012-10-09 17:03:41下载
- 积分:1