Conflict between complexity and description


Task description states there should be a merging of arrays. But complexity should be O(log (m+n)).
Complexity of actual merging cannot be so, O(m*log (n)) is the best complexity for actual merging. For merging we need to traverse all elements of one of the arrays.
So either there should be no actual merging or complexity should be different.


yes we need not merge the arrays