 Citations (11)
 Cited In (0)

Article: Optimizing stable inplace merging
[Show abstract] [Hide abstract]
ABSTRACT: In 2000, Geffert et al. (Theoret. Comput. Sci. 237 (2000) 159) presented an asymptotically efficient algorithm for stable merging in constant extra space. The algorithm requires at most m1(t+1)+m2/2t+o(m1) comparisons (t=⌊log2(m2/m1)⌋) and 5m2+12m1+o(m1) moves, where m1 and m2 are the sizes of two ordered sublists to be merged, and m1⩽m2. This paper optimizes the algorithm. The optimized algorithm is simpler than their algorithm, and makes at most m1(t+1)+m2/2t+o(m1+m2) comparisons and 6m2+7m1+o(m1+m2) moves.Theoretical Computer Science 01/2003; · 0.49 Impact Factor  Inf. Process. Lett. 01/1981; 12:58.
 [Show abstract] [Hide abstract]
ABSTRACT: Two lineartime algorithms for inplace/ merging are presented. Both algorithms perform at most comparisons, where m and n are the sizes of the input sequences, m⩽n, and . The first algorithm is for unstable/ merging and it carries out no more than element moves. The second algorithm is for stable/ merging and it accomplishes at most moves.Theoretical Computer Science 04/2000; · 0.49 Impact Factor
Data provided are for informational purposes only. Although carefully collected, accuracy cannot be guaranteed. The impact factor represents a rough estimation of the journal's impact factor and does not reflect the actual current impact factor. Publisher conditions are provided by RoMEO. Differing provisions from the publisher's actual policy or licence agreement may be applicable.