利用随机函数产生N个随机整数（20000以上），对这些数进行多种方法进行排序。

（1）至少采用三种方法（希尔排序、快速排序、堆排序）实现上述问题求解；

（2）统计每一种排序方法的性能（以上机运行程序所花费的时间为准进行对比），找出其中两种较快的方法；

（3）统计每种算法所用的比较次数和交换次数，最后列表显示；

-Using the random function random integers N (20,000 or more), the number of these various methods for sorting. (A) at least three methods (Hill sort, quick sort, heap sort) to achieve the above-mentioned problem solving　(2) statistical performance of each sort method (above machine running the program based on the time it takes to compare), identify two of the faster method　(3) statistical comparison of each algorithm used in the frequency and the number of exchanges, the final list display