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 .

[2] SMOOTHSORT, AN ALTERNATIVE FOR SORTING INSITU [J].

DIJKSTRA, EW .

HARRIS, JD .

[4] QUICKSORT [J].

HOARE, CAR .

[5]

Knuth D.E., 1972, ART COMPUTER PROGRAM, V3

[6] ALGORITHM 271 QUICKERSORT [M1] [J].

SCOWEN, RS .

[7] IMPLEMENTING QUICKSORT PROGRAMS [J].

SEDGEWICK, R .

[8]

SEDGEWICK R, 1975, STANCS75492 REP

[9] AN EFFICIENT ALGORITHM FOR SORTING WITH MINIMAL STORAGE [J].

SINGLETON, RC .

[10] INCREASING EFFICIENCY OF QUICKSORT [J].

VANEMDEN, MH .