常用内部排序算法：直接插入排序,希尔派序,冒泡排序,快速排序,简单选择排序,堆排序.

对每种排序方法，记录其数据比较次数和数据移动次数。要求待排序数据不少于100，数据分布在一个较大的范围内，若1000。-Common internal sorting algorithms: direct insertion sort, Hill sent order, bubble sort, quick sort, simple selection sort, heap sort order for each method, recording its data comparing the number of times and data movement. Sort the data required to be not less than 100, data is distributed over a larger range, if 1000.