EXPLOITING PARTIAL ORDER WITH QUICKSORT

被引:13
作者
DROMEY, RG
机构
关键词
D O I
10.1002/spe.4380140603
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
引用
收藏
页码:509 / 518
页数:10
相关论文
共 10 条
[1]   BEST SORTING ALGORITHM FOR NEARLY SORTED LISTS [J].
COOK, CR ;
KIM, DJ .
COMMUNICATIONS OF THE ACM, 1980, 23 (11) :620-624
[2]   SMOOTHSORT, AN ALTERNATIVE FOR SORTING INSITU [J].
DIJKSTRA, EW .
SCIENCE OF COMPUTER PROGRAMMING, 1982, 1 (03) :223-233
[3]   SORTING UNSORTED AND PARTIALLY SORTED LISTS USING THE NATURAL MERGE SORT [J].
HARRIS, JD .
SOFTWARE-PRACTICE & EXPERIENCE, 1981, 11 (12) :1339-1340
[4]   QUICKSORT [J].
HOARE, CAR .
COMPUTER JOURNAL, 1962, 5 (01) :10-&
[5]  
Knuth D.E., 1972, ART COMPUTER PROGRAM, V3
[6]   ALGORITHM 271 QUICKERSORT [M1] [J].
SCOWEN, RS .
COMMUNICATIONS OF THE ACM, 1965, 8 (11) :669-&
[7]   IMPLEMENTING QUICKSORT PROGRAMS [J].
SEDGEWICK, R .
COMMUNICATIONS OF THE ACM, 1978, 21 (10) :847-857
[8]  
SEDGEWICK R, 1975, STANCS75492 REP
[9]   AN EFFICIENT ALGORITHM FOR SORTING WITH MINIMAL STORAGE [J].
SINGLETON, RC .
COMMUNICATIONS OF THE ACM, 1969, 12 (03) :185-+
[10]   INCREASING EFFICIENCY OF QUICKSORT [J].
VANEMDEN, MH .
COMMUNICATIONS OF THE ACM, 1970, 13 (09) :563-&