1.实验题目：设计一个程序excise6.cpp，随机产生n个1~99的正整数序列，分别采用直接插入排序、折半插入排序、希尔排序、冒泡排序、快速排序、直接选择排序、堆排序和二路归并排序算法对其进行递增排序，求出每种排序方法所需要的绝对时间。
2.实验项目组成：利用随机数函数产生一个序列，再调用各个排序算法并记录运行时间。(1. experimental subjects: design a program of excise6.cpp, the sequence of positive integers n a randomly generated 1~99, respectively, direct insertion sort, binary insertion sort, Hill sort, bubble sort, quick sort, direct selection sort, heap sort and merge sort algorithm on the two in ascending order by calculating the absolute time of each sorting methods needed.
2. experimental items: a sequence generated by random number function, then call each sorting algorithm, and record the running time.)