-
PX
说明: 一个用VS2008编写的冒泡排序算法演示程序,数组都是随机生成的。(Bubble Sort)
- 2014-06-18 20:06:13下载
- 积分:1
-
a
说明: 进程死锁.资源分配图的绘制 建立所需数据结构;
使用题目21存成的资源分配图的文件作为输入;
编写资源分配图化简算法;
每化简一步,在屏幕上显示化简的当前结果;
最后给出结论,是否死锁,如思索给出死锁的进程及资源;
(Process deadlock. Resource allocation mapping establish the required data structures Use title 21 deposit into resource allocation graph file as input writing resource allocation map simplification algorithm Each simplification step, on-screen display simplification of the current result Finally, the conclusion of a deadlock, deadlock is given as thinking processes and resources )
- 2013-07-04 19:50:58下载
- 积分:1
-
host2
说明: 马踏棋盘算法编程,实现在棋盘上任意两点间的最短路径求解。(horse riding chessboard programming algorithm to achieve on the chessboard arbitrary 2:00 of finding the shortest path.)
- 2006-04-30 00:12:21下载
- 积分:1
-
suanfa
自己编写的floyd 最短距离求解程序。实用简单。gcc
(Floyd shortest distance to write your own solver. Practical and simple. gcc)
- 2012-09-02 14:59:02下载
- 积分:1
-
Polynomial
Polynomial基于数据结构的思想,文件比较小,可以直接运行(Polynomial based on the idea of data structures, file is relatively small and can be run directly)
- 2013-12-11 11:05:18下载
- 积分:1
-
Subset
说明: 子集和数问题.rar,用C++写的,可以运行(Subset of several problems. Rar, written in C++, you can run)
- 2010-04-16 17:42:12下载
- 积分:1
-
B_Tree
用控制台实现了经典的数据结构B树,可以通过测试文件.txt加载已有的B树,有插入,删除,查找的功能,加深对数据结构的理解。(Using the console to achieve the classic B tree data structure, you can pass the test document. Txt already loaded B-tree, there are insert, delete, search functions, to deepen understanding of the data structure.)
- 2020-10-18 17:47:26下载
- 积分:1
-
sstring
利用串来比较数据大小,代码中有两个串,通过串来比较大小(
10/5000
Use the string to compare the data size)
- 2016-12-20 17:05:29下载
- 积分:1
-
maze
迷宫求解一般采用“穷举法”,逐一沿顺时针方向查找相邻块(一共四块-东(右)、南(下),西(左)、北(上))是否可通,即该相邻块既是通道块,且不在当前路径上。用一个栈来记录已走过的路径栈是限定仅在表尾(top)进行插入或删除操作的线性表。(Maze solving generally use the " exhaustive" one by one to find adjacent blocks in a clockwise direction (a total of four- East (right), South (down), West (left), North (on)) whether to pass, that the both channel blocks adjacent blocks, and not in the current path. Use a stack to record the path traversed stack is limited only in the tail (top) to insert or delete a linear form.)
- 2013-12-13 17:55:45下载
- 积分:1
-
QuickSort
快速排序,用数组的存储结构,实现数的排序。共有八组随机数据,还能够计算出每组数据的处理时间,最终得到平均时间。(Quicksort array storage structure, to achieve the sort of number. A total of eight sets of random data, but also be able to calculate the processing time of each data, and eventually obtain the average time.)
- 2013-03-22 21:21:16下载
- 积分:1