Skip Navigation

The Computer Journal 1988 31(6):553-556; doi:10.1093/comjnl/31.6.553
© 1988 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (2)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by DvoRák, S.
Right arrow Articles by Durian, B.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Merging by Decomposition Revisited

S. DvoRák1 ¶ * and B. Durian2 §

1 Centre of Tesla Rosnov, 1. maje 1000, 75661 Roznov pod Radhostem, Czechoslovakia, 2 Research Institute of Computer Technology (VUVT) Zilina, Nerudova 33, 01001 Zilina, Czechoslovakia

This paper presents some modifications of stable merging by decomposition (referred to as DM here). The changes made reduce the time requirements considerably. Furthermore, a O(1)-space version of merging is described. The modifications of DM resemble improvements to the original Quicksort method for sorting, since both the algorithms are of the same generic scheme.

Received September 1986. revised March 1987.

* Centre of Tesla Roznov, 1. máje 1000, 75661 Roznov pod Radhostem, Czechoslovakia

§ Research Institute of Computer Technology (VÚVT) Zilina, Nerudová 33, 01001 Zilina, Czechoslovakia

To whom correspondence should be addressed.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.