约瑟夫环数据结构实验报告

系统用srand()函数产生一个以当前时间开始的随机种子。其产生的种子用选择排序、冒泡排序、快速排序将顺序表中的数字排好，设置变量记录每种排序关键字的移动次数和关键字的比较次数。选择排序：利用L.length-1个循环，将随机种子按从小到大的顺序排好。(System with srand () function generates a random seed to start the current time. Which produces seeds with selection sort, bubble sort, quick sort the order of numbers in the table lined up, set the variable record number of comparisons for each mobile number and keyword sort key. Sort: use L.length-1 cycle, the random seed small to large order lined up. )

分析汉诺塔，选择合适方法编程实现汉诺塔问题的解答。(Analysis of the Tower of Hanoi, select the appropriate method of programming the answers of the Tower of Hanoi problem.)

这是一个二叉树程序，包含删除等功能，希望帮助到大家(This is a binary tree program, including deletion and other functions, I hope to help you.)

邻接表存储图，然后进行深度优先遍历及广度优先遍历。(DFS,adjacent matrix)

经典C语言程序：图形 数据结构 时间函数 文件等(Classic C language program: a function of time graph data structure documents, etc.)

说明：  递归算法，可以实现汉诺塔算法,通过算法实现递归操作(Recursive algorithm can realize Hanoi tower algorithm)

利用极小极大算法实现简单的零和博弈；利用递归算法实现博弈树搜索的方法，并解决牛角棋问题。(Using minimal algorithm to achieve a simple zero-sum game the use of recursive algorithm to achieve the game tree search method, and solve the horns chess problem.)

线性表的链接实现可利用单链表来实现，每个节点存储一个元素。 利用单链表来实现线性表的元素的插入，删除，修改等功能。 (Linear link table can be used to achieve a single linked list to implement, each node stores an element. Using a single linked list to implement elements of the linear table insert, delete, modify, and other functions.)

冒泡优化： 如果一个序列是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.)

主要用栈和树求解骑士问题，用C++语言编写的(The main stack and tree Cavalier Problem Solving with C++ languages)