| 摘要: |
| 在一维数组快速排序算法的基础上,给出了二维数组的快速排序算法。理论分析和大量的数值实验结果表明,其算法的平均计算时间仍然是O(nlog2n),一般所需的栈空间仍为O(log2n),是有效而可靠的快速排序算法。 |
| 关键词: 二维数组 一维数组 快速排序 算法 |
| DOI： |
| 投稿时间：1997-01-27修订日期：1997-03-23 |
| 基金项目: |
|
| Quick Sorting Algorithm of Two dimensional Array |
|
Peng Yueying
|
| (Computer Center, Guangxi Teachers College, East Mingxiulu, Nanning, Guangxi, 530001) |
| Abstract: |
| On the basis of the quick sorting algorithm of one-dimensional array,the quick sorting algorithm of two-dimensional array was provided. Theoretical analysis and the results from a large number of experiments dealing with data showed that the average calculation time of the algorithm was O(nlog2n),and generally the required stack space was also O(log2n), which was an effective and reliable quick sorting algorithm. |
| Key words: two-dimensional array one-dimensional array quick sorting alg orithm |
