| Hoare分类算法的效率改进研究 |
| |
| 引用本文： | 张钟澍. Hoare分类算法的效率改进研究[J]. 成都信息工程学院学报, 1993, 0(1) |
| |
| 作者姓名： | 张钟澍 |
| |
| 作者单位： | 成都气象学院科研所 |
| |
| 摘 要： | 本文是一篇如何实现改进Hoare分类算法效率的方法研究。文中提出的一个新的快速分类的改进方案优于其它的快速分类算法,其平均分类速度是Hoare原算法的1.6倍左右,额外的内存开销仅为2*[log_2(N/10)]。文中还给出了在IBM-PC/XT微机上对大量随机数排序的实验结果。
|
| 关 键 词： | 分类算法 时间化费 内存开销 |
THE RESEARCH FOR IMPLEMENTING HOARE''''S SORTING ALGORITHM |
| |
| Zhang Zhongshu. THE RESEARCH FOR IMPLEMENTING HOARE''''S SORTING ALGORITHM[J]. Journal of Chengdu University of Information Technology, 1993, 0(1) |
| |
| Authors: | Zhang Zhongshu |
| |
| Abstract: | A practical study of how to implement the Hoare's Quick-Sorting Algorithm is presented in the paper. The new improved method is better than popular improved Quik-Sorting and the ever-age running time is approximately 1. 6 times as fast as the original Quick-Sorting. The overhead of additional storage is only 2 * [log2(N/10)]. Some running results of random data on IBM-PC/XT are given in this paper. |
| |
| Keywords: | Sorting Algorith Time cost Memory overhead. |
| 本文献已被 CNKI 等数据库收录！ |
