In-place merge of two arrays

Question

We have an array of size m+n in which m elements are present, in sorted order, and a second array of size n, again in sorted order. We want both of

Answer 1

In-place basically requires we only use "constant" amount of memory, which does not change with different input array sizes. However, the question itself allocate extra amount of memory that is the same to the size of one of the two input arrays, which is O(n) memory in worst case. This basically makes the idea of "in-place" meaningless...

The question might be better phrased as "merge without extra memory", which is a more precise description of its real intention...