-
joseph
用链表解决约瑟夫问题。
约瑟夫环是一个数学的应用问题：已知n个人（以编号1，2，3...n分别表示）围坐在一张圆桌周围。从编号为k的人开始报数，数到m的那个人出列；他的下一个人又从1开始报数，数到m的那个人又出列；依此规律重复下去，直到圆桌周围的人全部出列。
其中包括一个实验报告，介绍了编程思路和输出结果截图。(List to resolve Joseph. Josephus is the application of a mathematical problem: Given n individuals (numbered 1, 2, 3, ... n, respectively) sitting around a round table around. From number k people began to count off the number to m the man out of the line his next person and from a number off, the man was out of the line number to m so regularly repeated down until roundtable around of the people all of the columns. Including a lab report describes the programming ideas and output screenshots.)
- 2012-08-27 22:37:52下载
- 积分：1
-
process_schedule
演示进程调度算法 使用的链表 包涵7个功能 4个算法(Process Scheduling Algorithm Demo
)
- 2011-12-24 10:52:17下载
- 积分：1
-
suanfa
插入排序与合并排序的算法比较，比较两种算法的优劣(Comparison of insertion sort and merge)
- 2011-12-13 22:28:33下载
- 积分：1
-
chazhao
数据结构课程作业，查找算法。用哈希算法下实行查找(Data structure course work, search algorithm. Under the hash algorithm used to find)
- 2009-07-08 02:41:51下载
- 积分：1
-
data_structure
数据结构c源代码实现，大概有100个左右，基本上将所有的数据结构都有介绍(Data structures c source code to achieve, there are about 100 or so, basically all of the data structures are described)
- 2012-07-19 21:43:52下载
- 积分：1
-
LR(0)
简单LR语法分析程序自动生成器的实现，可用作数据结构课程设计(LR (0) grammar analysis)
- 2013-09-22 09:26:25下载
- 积分：1
-
work1
讲解了循环单链表的建立，以及在链表中插入、删除、更改数据...(Explain the establishment of circular single linked list, and insert in the list, delete, change the data ...)
- 2010-10-03 11:00:45下载
- 积分：1
-
tt0202
1.建立两个有序得链表（带表头，用头插法）；
//2.写一算法在单链表上实现线性表的ListLength(L)运算。
写一算法将单链表中值重复的结点删除，使所得的结果表中各结点值均不相同。
(1. The establishment of two ordered lists too (with header, with the first interpolation) // 2. To write a method to achieve a single linked linear form of ListLength (L) operations. Write an algorithm to list the value of a single node to delete the duplicate, so the results in the table are not the same as the value of each node.)
- 2010-09-10 10:26:46下载
- 积分：1
-
Kruskal
采用Kruskal算法求最小生成树主要数据结构
edgeset GE 存放图中的所有边
int n,int e 存放图中的顶点数与边数
edgeset C 存放生成树中的边
vexlist gv 图中结点的顶点值
adjmatrix s 用来处理图中结点的查找与合并
int m1,m2 一条边上两顶点所属集合的序号
int k 最小生成树中的边数
int d //图中待扫描边元素的下标(For the Minimum Spanning Tree by Kruskal main data structures edgeset GE store all edges in the figure int n, int e store graph vertices and edges edgeset C storage spanning tree edges in the vexlist gv graph node vertex values adjmatrix s used to process graph node to find and merge int m1, m2 an edge belongs to the set number two vertices int k minimum spanning tree edges int d // figure to be Scan edge element subscript)
- 2011-05-17 10:22:56下载
- 积分：1
-
yu992324
总结了10种排序的方式。用代码加以实现。(the ten way of Line up a preface)
- 2010-07-29 09:41:07下载
- 积分：1
