AN EFFICIENT ALGORITHM FOR SORTING WITH MINIMAL STORAGE

被引:80
作者
SINGLETON, RC
机构
[1] Stanford Research Institute, Menlo Park, CA
关键词
digital computer sorting; minimal storage sorting; sorting;
D O I
10.1145/362875.362901
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
[No abstract available]
引用
收藏
页码:185 / +
页数:1
相关论文
共 6 条
[1]   CERTIFICATION OF ALGORITHM 271 (M1) QUICKERSORT [J].
BLAIR, CR .
COMMUNICATIONS OF THE ACM, 1966, 9 (05) :354-&
[2]  
HIBBARD T. N., 1962, Journal of the ACM, V9, P13, DOI [DOI 10.1145/321105.321108, 10.1145/321105.321108]
[3]   AN EMPIRICAL STUDY OF MINIMAL STORAGE SORTING [J].
HIBBARD, TN .
COMMUNICATIONS OF THE ACM, 1963, 6 (05) :206-213
[4]  
Hoare Charles A. R., 1961, Commun. ACM, V4, P321
[5]   ALGORITHM 271 QUICKERSORT [M1] [J].
SCOWEN, RS .
COMMUNICATIONS OF THE ACM, 1965, 8 (11) :669-&
[6]   A HIGH-SPEED SORTING PROCEDURE [J].
SHELL, DL .
COMMUNICATIONS OF THE ACM, 1959, 2 (07) :30-32