本程序的主要功能在对起泡排序,直接插入排序,简单选择排序,快速排序,希尔排序,堆排序六种内部排序算法的时间复杂度进行比较.主要工作是设法在已知算法中的适当位置插入对关键字的比较次数和移动次数的操作.记录比较次数,移动次数,实现对六种算法复杂度的比较-The primary function of this process in the bubble sort, insertion sort of direct, simple options to sort, quick sort, Hill sort HEAPSORT six internal sorting algorithm time complexity comparison. The main work is to try known algorithm the appropriate place to insert keywords compared to the number and mobile number of the operation. Comparison of the number of records, mobile number, the realization of the complexity of the six comparison algorithm