Design and implement a merging algorithm that uses only two arrays. It can be assumed that the sizes of the two data sets are known in advance. An interesting way to do this is to place the array with the biggest element so that it fills up the output (merged) array. The following diagram illustrates the idea (the b array has the largest element).

This simplifies the merge because when the merging of a is completed the remaining elements of b will be I place.