Abstract
Given two ordered vectors of n elements each, a simple algorithm is proposed to merge them in-place, i.e., using only a fixed amount of extra storage. The combinatorial problems raised by the analysis of the algorithm are solved, showing that its average running time is in the order of O( n 1.5). The algorithm is then extended to vectors of any size. Finally, the “divide and conquer” methodology is applied to reduce the complexity of the algorithm to O( n 1.2).
Full Text
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call