Multiway in-place merging

Authors:
Viliam Geffert;Jozef Gajdoš
Affiliations:
Department of Computer Science, P. J. Šafárik University, Košice, Slovakia;Department of Computer Science, P. J. Šafárik University, Košice, Slovakia
Venue:
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
Year:
2009

Citing 8
Cited 1

A simple linear-time algorithm for in situ merging

Information Processing Letters
BOTTOM-UP-HEAPSORT, a new variant of HEAPSORT beating, on an average, QUICKSORT (if n is not very small)

MFCS '90 Selected papers of the 15th international symposium on Mathematical foundations of computer science
The art of computer programming, volume 3: (2nd ed.) sorting and searching

The art of computer programming, volume 3: (2nd ed.) sorting and searching
In-place sorting with fewer moves

Information Processing Letters
Asymptotically efficient in-place merging

Theoretical Computer Science
Practical in-place mergesort

Nordic Journal of Computing
Optimizing stable in-place merging

Theoretical Computer Science
An in-place sorting with O(nlog n) comparisons and O(n) moves

Journal of the ACM (JACM)

Multiway in-place merging

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present an algorithm for asymptotically efficient k-way merging. Given an array A containing sorted subsequences A1,...,Ak of respective lengths n1,...,nk, where Σi=1k ni = n, our algorithm merges A1,...,Ak in-place, into a single sorted sequence, performing ⌈ lg k ⌉ċn + o(n) element comparisons and 3ċn + o(n) element moves. That is, our algorithm runs in linear time, with the number of moves independent of k, the number of input sequences.