# Practical in-place merging

@article{Huang1988PracticalIM,
title={Practical in-place merging},
author={Bing-Chao Huang and M. A. Langston},
journal={Commun. ACM},
year={1988},
volume={31},
pages={348-352}
}
• Published 1 December 1987
• Computer Science
• Commun. ACM
We present a novel, yet straightforward linear-time algorithm for merging two sorted lists in a fixed amount of additional space. Constant of proportionality estimates and empirical testing reveal that this procedure is reasonably competitive with merge routines free to squander unbounded additional memory, making it particularly attractive whenever space is a critical resource.
83 Citations

## Figures and Tables from this paper

Fast Stable Merging and Sorting in Constant Extra Space
• Computer Science
Comput. J.
• 1992
A relatively simple strategy is divised by which this efficient merge can be made stable, and the results are extended in a nontrivial way to the problem of stable sorting by merging.
Time-Space Optimal Parallel Merging and Sorting
• Computer Science
IEEE Trans. Computers
• 1991
The authors present a parallel merging algorithm that, on an exclusive-read exclusive-write (EREW) parallel random-access machine (PRAM) with k processors merges two sorted lists of total length n in
Sorting In-Place with a Worst Case Complexity of n log n-1.3n + O(logn) Comparisons and epsilon n log n + O(1) Transports
A new variant of Merge-sort is presented, which needs only 1.25n space, because it uses space again, which becomes available within the current stage.
A Time-space Efficient Algorithm for Parallel k-way In-place Merging based on Sequence Partitioning and Perfect Shuffle
• Computer Science
• 2020
The huge data volumes, big data, and the emergence of new parallel architectures lead to revisiting classic computer science topics and the motivation of the proposed work for revisiting the parallel architectures is motivated by the desire to revisit these topics.
A simple algorithm for in-place merging
Parallel Methods for Solving Fundamental File Rearrangement Problems
• Computer Science
J. Parallel Distributed Comput.
• 1992
Time-Space Optimal Parallel Computation
The development of parallel file rearrangement algorithms that simultaneously optimize both time and space is surveyed. The classic problem of merging two sorted lists is used to illustrate
AN EXTERNAL SORTING ALGORITHM USING IN-PLACE MERGING AND WITH NO ADDITIONAL DISK SPACE
• Computer Science
• 2005
This paper presents an external sorting algorithm using linear-time in-place merging and without any additional disk space to reduce the average time complexity and disk I/Os especially the output (write) operations.
Merge sort enhanced in place sorting algorithm
• Computer Science
2016 International Conference on Advanced Communication Control and Computing Technologies (ICACCCT)
• 2016
A new sorting algorithm which sorts the elements of an array In Place using Recursive Partitioning combined with In Place merging to sort a given array has O(n) best case Time Complexity and O( n log n) average and worst case time Complexity.
Stable Minimum Storage Merging by Symmetric Comparisons
• Computer Science
ESA
• 2004
We introduce a new stable minimum storage algorithm for merging that needs $$O(m\log(\frac{n}{m}+1))$$ element comparisons, where m and n are the sizes of the input sequences with m≤ n. According to

## References

SHOWING 1-9 OF 9 REFERENCES
A Simple Linear-Time Algorithm for in Situ Merging
• Computer Science
Inf. Process. Lett.
• 1984
Stable Sorting and Merging with Optimal Space and Time Bounds
This work introduces two algorithms for stable merging and stable sorting of files. The algorithms have optimal worst case time bounds, the merge is linear and the sort is of order $n \log n$. Extra
Virtual Memory Behavior of Some Sorting Algorithms
• Computer Science
IEEE Transactions on Software Engineering
• 1984
Experimnental results are given about the performance of six sorting algorithms in a virtual memory based on the working set principle, and quicksort turns out to be the best algorithm, also in a working set virtual memory environment.
Stable Sorting in Asymptotically Optimal Time and Extra Space
A stable sorting algorithm may be derived directly from a stable merging algorithm, and how the Stable Kronrod Merge may be combined with contlguent-formmg algorithms to yield a generally applicable class of stable merging algorithms is shown.
Towards an Efficient Merging
• Computer Science
MFCS
• 1986
The recent results for merging developed by the authors are being described and a new algorithm for fast stable merging, which works in linear time and in O(N1/2) space, is given.
Stable set and multiset operations in optimal time and space
• Computer Science, Mathematics
PODS '88
• 1988
An asymptotically optimal time and space algorithm is devised for stably selecting matched records from a sorted file, and this selection strategy is employed, along with other algorithmic tools, to prove that all of the elementary binary set operations can be stably performed in optimalTime and space on sorted files.
The art of computer programming: sorting and searching (volume 3)
Apparatus for supporting different nets for various sporting purposes including interengaging tubular rods which are arranged to interconnect and have ground engaging portions suitable to be useful
An optimal ordering algorithm without a field of operation ( in Russian ) , Dok . Aknd
An optimal ordering algorithm without a field of operation (in Russian), Dok. Aknd. Nauk SSSR 186 (196!& 1X6-1258. Manila, H., and Ukkonen, E. A simple linear-time algorithm for in Situ ItErging
• information Processing Letters
• 1984