对以下六种常用的内部排序算法进行比较：希尔排序、直接选择排序、快速排序、直接插入排序、堆排序、冒泡排序、。

（2）待排序表的表长和数据可以由用户自己确定，也可以由随机数产生程序自动产生；至少要用五组不同的输入数据作比较；比较的指标为关键字的比较次数和关键字的移动次数（关键字的交换计为三次移动）。

（3）最后要对结果作出简单分析。

-Six commonly used internal sorting algorithm: Hill Sort by direct selection sort, quick sort, insertion sort, heap sort, bubble sort. (2) to be sorted table the table length and data can be determined by the users themselves can also be automatically generated by the random number generator　spend at least five different sets of input data for comparison　comparable indicators for the number of comparisons and key of the keyword number of moves of the word (keyword exchange is counted as the third movement). (3) Finally, a simple analysis of the results.