ANALYSIS OF THE PERFORMANCE OF THE PARALLEL QUICKSORT METHOD

被引：7

作者：

EVANS, DJ

YOUSIF, NY

机构：

[1] LOUGHBOROUGH UNIV TECHNOL,DEPT COMP STUDIES,LOUGHBOROUGH LE11 3TU,LEICS,ENGLAND

[2] UNIV BASRAH,COLL SCI,DEPT COMP SCI,BASRAH,IRAQ

来源：

BIT | 1985年 / 25卷 / 01期

关键词：

D O I：

10.1007/BF01934992

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

引用

页码：106 / 112

页数：7

共 11 条

[1]

BARLOW RH, 1981, GUIDE USING NEPTUNE

[2]

BARLOW RH, 1977, 59 LOUGHB U COMP STU

[3] THE PARALLEL QUICKSORT ALGORITHM .2. SIMULATION [J].

EVANS, DJ ;

DUNBAR, RC .

[4]

EVANS DJ, INT J COMP MATH, V12, P19

[5]

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

[6]

Knuth D. E., 1973, ART COMPUTER PROGRAM

[7]

LOSER R, 1974, COMM ACM, V17, P143

[8] ANALYSIS OF QUICKSORT PROGRAMS [J].

SEDGEWICK, R .

[9] IMPLEMENTING QUICKSORT PROGRAMS [J].

SEDGEWICK, R .

[10]

SEDGEWICK R, 1975, THESIS STANFORD U ST