QUICKSORT
QUICKSORT
复制标题
DOI：
10.1093/comjnl/5.1.10
复制
发表时间：
1962-01-01
期刊：
影响因子：
1.4
通讯作者：
HOARE, CAR
中科院分区：
文献类型：
--
作者：
HOARE, CAR
本文介绍了一种在计算机随机存储器中进行排序的新方法。该方法在速度、存储经济性和编程方便性方面与其它已知方法相比非常有利。该方法的某些改进，这可能是有用的内部循环的优化，在第二部分的文件中描述。
A description is given of a new method of sorting in the random-access store of a computer. The method compares very favourably with other known methods in speed, in economy of storage, and in ease of programming. Certain refinements of the method, which may be useful in the optimization of inner loops, are described in the second part of the paper.