Merge a sorted array of size n into another sorted array of size m+n

int merge(int M[], int N[], int m, int n) 
{
int k = m + n - 1;
m--, n--;

while(n >= 0 && m >= 0)
M[k--] = M[m] > N[n] ? M[m--] : N[n--];

while(n >= 0)
M[k--] = N[n--];
}
Advertisements

One thought on “Merge a sorted array of size n into another sorted array of size m+n

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s