SIGNIFICANT IMPROVEMENTS TO THE HWANG-LIN MERGING ALGORITHM

被引:19
作者
MANACHER, GK
机构
[1] Department of Information Engineering, University of Illinois at Chicago Circle, Chicago, IL 60680, Computer Center
关键词
Hwang-Lin algorithm; merging;
D O I
10.1145/322139.322144
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
The Hwang-Lin mergmg algorithm is the best general-purpose merging algorithm that has been found Many improvements to it have been devtsed, but these are etther for special values of m and n, the number of items being merged, or else zmprovements by a term less than hnear m n + m when the ratio n/m is fixed A new methodology is developed m which, for fixed ratio n/m, It ts possible to decrease the number of comparisons by a factor proportional to m, m fact m/12, provided n/m ≥ 8 and m ≥ 24 It is shown that the coefficient 1/12 is not best possible, and a techmque for lmprowng it slightly to 31/336 is sketched. © 1979, ACM. All rights reserved.
引用
收藏
页码:434 / 440
页数:7
相关论文
共 8 条
[1]  
GRAHAM RL, 1971, 2ND P ATL C
[2]  
Hwang F. K., 1971, ACTA INFORM, V2, P145, DOI [10.1007/BF00289521, DOI 10.1007/BF00289521]
[3]   CLASS OF MERGING ALGORITHMS [J].
HWANG, FK ;
DEUTSCH, DN .
JOURNAL OF THE ACM, 1973, 20 (01) :148-159
[4]  
Hwang FK., 1972, SIAM J COMPUT, V1, P31, DOI 10.1137/0201004
[5]  
HWANG FK, COMMUNICATION
[6]  
HWANG FK, 1972, SOME OPTIMALITY RESU
[7]  
KNUTH DE, 1973, ART COMPUTER PROGRAM, V3, P181
[8]   FORD-JOHNSON SORTING ALGORITHM IS NOT OPTIMAL [J].
MANACHER, GK .
JOURNAL OF THE ACM, 1979, 26 (03) :441-456