Towards an efficient merging
-a fast stable merging, which works in linear time and in O(N1/2) space (N is the total number of merged items). A new algorithm for such merging is given. The version of it for unstable merging requires just O(1)-space;
-a fast stable merging, which works in slightly nonlinear time and with variable workspace for merging. This algorithm is a thorough revision of that of Dudzinski and Dydek. O(1)-space version of this algorithm is discussed, too.
The experimental evaluation of these algorithms proved that they are the fastest in the corresponding classes.
KeywordsMerging space and time complexity algorithms
Unable to display preview. Download preview PDF.
- D.E. Knuth, The art of computer programming, Vol. III: Sorting and searching, Addison-Wesley, Reading, Mass., 1973.Google Scholar
- L.T. Pardo, Stable sorting and merging with optimal space and time bounds, SIAM J. Comp. 6(2) (1977) 351–372.Google Scholar
- K. Duzinski, A. Dydek, On a stable minimum storage merging algorithm, Inf. Proc. Lett. 12(1) (1981) 5–8.Google Scholar
- M.A. Kronrod, An optimal ordering algorithm without a field of operation. Dokl. Akad. Nauk USSR 186 (1969) 1256–1258.Google Scholar
- H. Mannila, E. Ukkonen, A simple linear-time algorithm for in-situ merging, Inf. Proc. Lett. 18(1984) 203–208.Google Scholar
- B. Durian, Stable merging in O(N) memory and nonstable merging in O(1) memory (in Slovak), Informačné systémy, Vol. 14, no. 1 (1985) 67–86.Google Scholar
- S. Dvořák, B. Ďurian, How to perform stable merging in a sublinear workspace? (to appear).Google Scholar
- B. Ďurian, S. Dvořák, Making the DD-merging efficient (to appear).Google Scholar
- B. Ďurian, Quicksort without a stack (in this proceedings).Google Scholar