Efficient algorithms for merging
- 35 Downloads
Efficient algorithms are given to find the maximum lengthn of an ordered list in which 4 elements can be merged using exactlyk comparisons. A top down algorithm for the (2,n) merge problem is discussed and is shown to obtain the optimal merge length first reported by Hwang and Lin. Our algorithms combine this top down approach and strong heuristics, some of which derived from Hwang's optimal algorithm for the (3,n) problem, and produce a lengthn which is close to the optimal lengthf4(k).
KeywordsOptimal merging top down approach heuristic approach
Unable to display preview. Download preview PDF.
- 1.V. S. Alagar, T. D. Bui and Mai Thanh,Efficient algorithms for merging, Dept. of Computer Science, Technical Report, Concordia University (1983).Google Scholar
- 2.C. Christen,Improving the bounds on optimal merging. Proc. 19th Annual IEEE Conf. on the Foundations of Computer Science (1978), 259–266.Google Scholar
- 3.R. L. Graham,On sorting by comparisons, Computers in Number Theory, A. O. L. Atkin and B. J. Birch, Eds., Academic Press, London (1971), 263–269.Google Scholar
- 4.F. K. Hwang,Optimal merging of 3 elements with n elements, SIAM J. Computing 9 (1980), 298–320.Google Scholar
- 5.F. K. Hwang and S. Lin,Optimal merging of 2 elements with n elements, Acta Informatica 1 (1971), 145–158.Google Scholar
- 6.Mai Thanh and T. D. Bui,An improvement of the binary merge algorithm, BIT 22 (1982), 454–462.Google Scholar
- 7.P. K. Stockmeyer and F. F. Yao,On the optimality of linear merge, SIAM J. Computing 9 (1980), 85–90.Google Scholar
- 8.J. S. Mönting,Merging of 4 or 5 elements with n elements, Theoretical Computer Science 14 (1981), 19–37.Google Scholar