| 二维数组的快速排序算法 |
| |
| 引用本文： | 彭月英.二维数组的快速排序算法[J].广西科学,1997,4(2):93-96. |
| |
| 作者姓名： | 彭月英 |
| |
| 作者单位： | 广西师范学院计算中心 |
| |
| 摘 要： | 在一维数组快速排序算法的基础上，给出了二维数组的快速排序算法，理论分析和大量的数值实验结果表明，其算法的平均计算时间仍然是Ｏ（ｎｌｏｇ２ｎ），一般所需的栈空间仍为Ｏ（ｌｏｇ２ｎ），是有效而可靠的快速排序算法。
|
| 关 键 词： | 二维数组 一维数组 快速排序 算法 排序问题 |
| 收稿时间： | 1997/1/27 0:00:00 |
| 修稿时间： | 1997/3/23 0:00:00 |
Quick Sorting Algorithm of Two dimensional Array |
| |
| Peng Yueying.Quick Sorting Algorithm of Two dimensional Array[J].Guangxi Sciences,1997,4(2):93-96. |
| |
| Authors: | Peng Yueying |
| |
| Institution: | 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. |
| |
| Keywords: | two-dimensional array one-dimensional array quick sorting alg orithm |
| 本文献已被 CNKI 维普 等数据库收录！ |
| 点击此处可从《广西科学》浏览原始摘要信息 |
| 点击此处可从《广西科学》下载免费的PDF全文 |
|
