QUICKSORT

数据结构课程作业，查找算法。用哈希算法下实行查找(Data structure course work, search algorithm. Under the hash algorithm used to find)

Devil language 数据结构中的经典问题 此为问题!(Devil language data structure of the classic problems of this problem!)

对元素类型为整型的顺序存储的线性表进行插入、删除和查找操作(C++)。(C integer linear sequence of stored data table insert, delete and search operations)

说明：  进程死锁.资源分配图的绘制 建立所需数据结构；  使用题目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 )

说明：  一个用VS2008编写的冒泡排序算法演示程序，数组都是随机生成的。(Bubble Sort)

本程序解决的是：模拟类似计算机主、缓存的存储结构，当用户请求某个页面时，若某个页面已在缓存中，则直接从缓存中去取，不会产生失误（即未在缓存中命中），否则，就到主存中去取，代价变大。 本程序采用随机标记算法，即在在线标记算法的基础上，对于替换页面时，采用随机从未标记的缓存项中选出一项进行替换。 代码、文档详尽(Addressed in this program are: analog computer-like main, cache storage structure, when the user requests a page, a page in the cache directly from the cache to fetch, does not produce errors (that is, not in the cache in the hit), otherwise, to the main memory to fetch a consideration of larger. This program uses a random marking algorithm, online marking algorithm based on random never mark the cache entry selected a replacement for the replacement page. Code, documentation detailed)

一、 地理数据文件应用 对由点、线、面构成的地理数据文件进行打开、读取、关闭操作。 要求： 1、在C++环境下，通过程序设计实现文本格式数据文件的操作； 2、在打开数据文件后，生成点、线、面三个链表，分别用于记录三种类型的数据。 3、数据文件结构说明 (Geographic data file applications by point, line, surface consisting of geographic data file open, read, and close operations. Requirements: in C++ environment, through the program design text format data file operations 2, open the data file, generate points, lines, surfaces three linked list, respectively, for the record three types of data. 3, a data file structure)

求最长上升下降\非上升非下降的刷表法(Seeking maximum rise fall Philippines rise fall Philippines brush table method)

说明：  用从c＋＋写的floyd最短路径算法，可以求邻接矩阵任意两点的最短路径。(from using c++ to write the Floyd shortest path algorithm, can help adjacency matrix arbitrary 2:00 Shortest Path.)

简单的汉诺塔算法，采用归约算法的思想，实例是三个盘子，三个柱子(Simple HANOR algorithm)