Skip to main content
SpringerLink
Log in

Towards an efficient merging

  • Communications
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1986 (MFCS 1986)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 233))

Abstract

The recent results for merging developed by the authors are being described. Namely, it is dealt with

  • -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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. D.E. Knuth, The art of computer programming, Vol. III: Sorting and searching, Addison-Wesley, Reading, Mass., 1973.

    Google Scholar 

  2. L.T. Pardo, Stable sorting and merging with optimal space and time bounds, SIAM J. Comp. 6(2) (1977) 351–372.

    Google Scholar 

  3. K. Duzinski, A. Dydek, On a stable minimum storage merging algorithm, Inf. Proc. Lett. 12(1) (1981) 5–8.

    Google Scholar 

  4. M.A. Kronrod, An optimal ordering algorithm without a field of operation. Dokl. Akad. Nauk USSR 186 (1969) 1256–1258.

    Google Scholar 

  5. H. Mannila, E. Ukkonen, A simple linear-time algorithm for in-situ merging, Inf. Proc. Lett. 18(1984) 203–208.

    Google Scholar 

  6. 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 

  7. S. Dvořák, B. Ďurian, How to perform stable merging in a sublinear workspace? (to appear).

    Google Scholar 

  8. B. Ďurian, S. Dvořák, Making the DD-merging efficient (to appear).

    Google Scholar 

  9. B. Ďurian, Quicksort without a stack (in this proceedings).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Tesla Rožnov, k.p., 1.máje 1000, 75661, Rožnov p. Radh., Czechoslovakia

    S. Dvořák

  2. VÚVT Žilina, k.ú.o., Nerudová 33, 01001, Žilina, Czechoslovakia

    B. Ďurian

Authors
  1. S. Dvořák
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. B. Ďurian
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jozef Gruska Branislav Rovan Juraj Wiedermann

Rights and permissions

Reprints and permissions

Copyright information

© 1986 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dvořák, S., Ďurian, B. (1986). Towards an efficient merging. In: Gruska, J., Rovan, B., Wiedermann, J. (eds) Mathematical Foundations of Computer Science 1986. MFCS 1986. Lecture Notes in Computer Science, vol 233. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0016253

Download citation

  • DOI: https://doi.org/10.1007/BFb0016253

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-16783-9

  • Online ISBN: 978-3-540-39909-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation