Merge sorted array
Merge a sorted array into another sorted array that has room at its end, in place, and give the complexity. Follow-up reported: could you merge starting from the front of each array instead of the back? Explain why filling from the back avoids overwriting, with an example. In one version the array sizes were not given.
No answer yet. Write the first one; the best answer gets endorsed.
