-
shiyan1
数据结构上机操作实验的实验1，线性表的基本操作！！！(the basic operation of sq of date structure)
- 2011-12-11 18:49:06下载
- 积分：1
-
maopao_youhua
冒泡优化：
如果一个序列是int n[]={1,2,3,4,5,6,7,8,9} , 用正常的冒泡排序需要排8次才行，优化之后1次就好，也就是说序列越接近于正常序列，改进之后的冒泡排序的次数就越少，这样会给一个冒泡排序算法带了很大的效率。
思想：添加一个boolean变量用来判断冒泡是否是已经排好了顺序，如果boolean的值为false，说明是已经排好了，如果boolean的值true，说明没有排好，继续排。(If a sequence is int n [] = {, 1,2,3,4,5,6,7,8,9} need to row 8 times the job after optimization times like normal bubble sort, but alsomeans that the sequence is more close to the normal sequence, improved bubble sort, the less the number, which would give a bubble sort algorithm with a great deal of efficiency.
Idea: add a boolean variable used to determine the bubble whether it is already lined up the order, if the boolean is false, indicating already lined up, if the boolean value of true, did not line up, continue to row.)
- 2012-04-18 00:33:45下载
- 积分：1
-
stringmatch
说明： 高速多字符串匹配程序，基于多字符串的KMP算法开发，能够实现多字符串的匹配(High-speed multi-string matching procedure, based on multi-string KMP algorithm development, to achieve multi-string match)
- 2009-07-22 10:36:52下载
- 积分：1
-
GraphTheory
讲述数据机构的图论部分和程序设计的关系，适合学习算法的同学学习阅读，很不错的一本书。(Graph theory algorithm and programming)
- 2013-12-04 20:12:39下载
- 积分：1
-
reverse
本实验设有一个线性表，分别实现数组结构存储的原地逆置。为数据结构课程必做实验。(This experiment has a linear form, respectively, to achieve the storage array structure in situ reverse home. For the data structure courses will do the experiment.)
- 2013-05-29 14:25:34下载
- 积分：1
-
arc
运用二叉树求代数表达式的值，将代数表达式的每个符号用二叉树结点表示，遍历图的每一结点，按结点值得不同采用不同运算方式(Solving algebraic expressions binary tree)
- 2012-06-23 19:52:38下载
- 积分：1
-
erchashu
平衡二叉树操作，可以输入数字形成二叉树，可以进行添加、删除操作(Balanced binary tree operation, you can enter numbers to form a binary tree, the user can add, delete)
- 2011-12-23 10:26:26下载
- 积分：1
-
Lecture7
数据结构中插入排序，堆栈排序等的用法还有希尔排序(Data structure insertion sort, stack, sort, etc. use well sorted Hill)
- 2011-07-27 15:31:31下载
- 积分：1
-
Project_ShortestPath
任务：实现Dijkstra算法
工程名：Project_ShortestPath
要求：实现Dijkstra算法，算法主体写在CGraph类中；要求是从command窗口中输入源节点编号，并在command窗口中输出从源节点到所有目的节点的最短路长及最短路。注：要输出整条路径，而不仅仅是前一跳，也不允许逆序输出。
(Task: Dijkstra' s algorithm to achieve the project name: Project_ShortestPath requirements: achieve Dijkstra algorithm, the algorithm written in the body CGraph class requires input from the command window, the source node number, and in the command window, all of the output from the source node to the destination node shortest long and the shortest. Note: To export the entire path, not just before the jump, do not allow reverse output.)
- 2013-08-21 16:40:41下载
- 积分：1
-
yinhangmoni
这是一个简单的银行模拟系统
1、 客户的到达时间随机
2、 客户需要处理的业务随机（不同业务处理的平均长度不同，例如：取款时间较短，开户和销户时间较长）
3、 处理客户业务所需时间随机（在一定范围内）
4、 使用文本文件记录每个客户到达时间、业务处理时间、业务结束时间
5、 动态显示（刷新时间可调）目前每个窗口累计处理客户数量、等待人数，每个窗口的平均业务处理时间，不同业务类型业务的累计办理量。
(This is a simple bank simulation system
1 customer arrival time random
2, customers need to deal with the business of random (the average length of the different business processes, such as: the withdrawal shorter, longer to open an account and cancel the account)
3, the time required to deal with customer service random (within certain limits)
4, using a text file to record each customer arrival time, business processing time, the business end of time
5 dynamically display (refresh time is adjustable) each window is accumulated to handle the number of customers waiting for the number the average business processing time of each window, different type of business operations total for the amount.)
- 2012-11-22 00:08:18下载
- 积分：1
