IMPROVED UPPER-BOUNDS ON SHELLSORT

被引:20
作者
INCERPI, J
SEDGEWICK, R
机构
[1] BROWN UNIV,DEPT COMP SCI,PROVIDENCE,RI 02912
[2] INST NATL RECH INFORMAT & AUTOMAT,F-78150 ROCQUENCOURT,FRANCE
关键词
D O I
10.1016/0022-0000(85)90042-X
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
引用
收藏
页码:210 / 224
页数:15
相关论文
共 14 条
[1]  
AJTAI M, 1983, 15TH P ANN ACM S THE
[2]  
CHAZELLE B, 1983, COMMUNICATION
[3]  
CURRANSHARP WJ, 1884, ED TIMES LONDON, V1
[4]   AN EFFICIENT VARIATION OF BUBBLE SORT [J].
DOBOSIEWICZ, W .
INFORMATION PROCESSING LETTERS, 1980, 11 (01) :5-6
[5]  
Johnson S.M., 1960, CAN J MATH, V12, P390
[6]  
Knuth D. E., 1973, ART COMPUTER PROGRAM
[7]  
LEIGHTON T, 1984, 16TH P ANN ACM S THE
[8]  
PAPERNOV A, 1965, PROBL INFORM TRANSM, V1, P63
[9]  
PRATT V, 1979, SHELLSORT SORTING NE
[10]  
PRATT V, 1971, THESIS STANFORD U