ANALYSIS OF QUICKSORT PROGRAMS

被引:73
作者
SEDGEWICK, R [1 ]
机构
[1] BROWN UNIV,DIV APPL MATH,PROGRAM COMP SCI,PROVIDENCE,RI 02912
关键词
D O I
10.1007/BF00289467
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
引用
收藏
页码:327 / 355
页数:29
相关论文
共 30 条
[1]  
ABRAMOWITZ M, 1970, HDB MATHEMATICAL FUN
[2]  
AHO AV, 1974, DESIGN ANALYSIS COMP
[3]   CERTIFICATION OF ALGORITHM 271 (M1) QUICKERSORT [J].
BLAIR, CR .
COMMUNICATIONS OF THE ACM, 1966, 9 (05) :354-&
[4]  
BOOTHROYD J, COMPUTER J, V10, P308
[5]   SORTING IN A PAGING ENVIRONMENT [J].
BRAWN, BS ;
GUSTAVSON, FG ;
MANKIN, FS .
COMMUNICATIONS OF THE ACM, 1970, 13 (08) :483-+
[6]  
Cocke John, 1970, PROGRAMMING LANGUAGE
[7]   SAMPLESORT - A SAMPLING APPROACH TO MINIMAL STORAGE TREE SORTING [J].
FRAZER, WD ;
MCKELLAR, AC .
JOURNAL OF THE ACM, 1970, 17 (03) :496-&
[8]   REMARK ON AN EFFICIENT ALGORITHM FOR SORTING WITH MINIMAL STORAGE [J].
GRIFFIN, R ;
REDISH, KA .
COMMUNICATIONS OF THE ACM, 1970, 13 (01) :54-&
[9]  
HILLMORE JS, 1962, COMMUN ACM, V5, P439, DOI 10.1145/368637.368709
[10]  
Hoare C. A. R., 1961, COMMUN ACM, V4, P321, DOI [DOI 10.1145/366622.366644, 10.1145/366622.366647, DOI 10.1145/366622.366647]