【摘要】 讨论了一种堆排序的改进算法，给出了算法思想，算法描述、算法分析和实验结果，其理论意义是改进了堆排序的时间复杂度，其实用价值是比堆排序法具有较高的排序效率，并且与数据类型、分布、范围无关。更多还原

【Abstract】 In this paper, an improved algorithm of heapsort is put forward. Its algorithmic ideas, algorithmic description, algorithmic analysis, and experimental results are given. Its theoretical significance is that it improves time complexity of heapsort. Its practical value is that it can the sort more efficiently than heapsort with no relation to data type, data distribution and number range.更多还原