使用简单数组实现下面各种排序算法，并进行比较。

排序算法：

　　　　1、插入排序

　　　　2、希尔排序

3、冒泡排序

4、快速排序

5、简单选择排序

6、堆排序

7、归并排序

8、基数排序

要求：

　　　　1、测试数据分成三类：正序、逆序、随机数据

2、对于这三类数据，比较上述排序算法中关键字的比较次数和移动次数（其中关键字交换计为3次移动）。

3、对于这三类数据，比较上述排序算法中不同算法的执行时间，精确到微秒-Using a simple array to achieve the following variety of sorting algorithms, and compare. Sorting algorithms: insertion sort, shell sort, bubble sort 4, the quicksort 5, simple select 6 sort, heap sort, merge sort, radix sort requirements: one, the test data is divided into three categories: positive sequence , reverse, random data for these three types of data, compare the number of keywords in the comparison of the sorting algorithm and the number of moves (where the key exchange is counted as three times a mobile). 3, three types of data, different algorithms in the comparison of the sorting algorithm execution time, accurate to the microsecond