BEST SORTING ALGORITHM FOR NEARLY SORTED LISTS

被引：67

作者：

COOK, CR ^{[1
]}

KIM, DJ ^{[1
]}

机构：

[1] NATL SEMI CONDUCTOR,SUNNYVALE,CA 94086

来源：

关键词：

D O I：

10.1145/359024.359026

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：620 / 624

页数：5

共 14 条

[1]

BOOTHROYD J, 1963, COMM ACM, V6, P615

[2]

BOOTHROYD J, 1963, COMMUN ASS COMPUT MA, V6, P445

[3]

ELSON M, 1975, DATA STRUCTURES

[4] ALGORITHM-245 - TREESORT 3 [M1] [J].

FLOYD, RW .

[5] COMPUTING LENGTH OF LONGEST INCREASING SUBSEQUENCES [J].

FREDMAN, ML .

[6]

Hoare C. A. R., 1961, COMMUN ACM, V4, P321, DOI [DOI 10.1145/366622.366644, 10.1145/366622.366647, DOI 10.1145/366622.366647]

[7]

Knuth D. E., 1973, ART COMPUTER PROGRAM

[8] SOME PERFORMANCE-TEST OF QUICKSORT AND DESCENDANTS [J].

LOESER, R .

[9] INTERNAL SORTING BY RADIX PLUS SIFTING [J].

MACLAREN, MD .

[10]

Martin W.A., 1971, ACM COMPUT SURV, V3, P147