-
Notifications
You must be signed in to change notification settings - Fork 9
/
Merge two sorted arrays
42 lines (38 loc) · 1010 Bytes
/
Merge two sorted arrays
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
#include <bits/stdc++.h>
using namespace std;
// Merge ar1[] and ar2[] with O(1) extra space
void merge(int ar1[], int ar2[], int m, int n)
{
// Iterate through all elements of ar2[] starting from
// the last element
for (int i=n-1; i>=0; i--)
{
/* Find the smallest element greater than ar2[i]. Move all
elements one position ahead till the smallest greater
element is not found */
int j, last = ar1[m-1];
for (j=m-2; j >= 0 && ar1[j] > ar2[i]; j--)
ar1[j+1] = ar1[j];
// If there was a greater element
if (j != m-2 || last > ar2[i])
{
ar1[j+1] = ar2[i];
ar2[i] = last;
}
}
}
int main(void)
{
int ar1[] = {1, 5, 9, 10, 15, 20};
int ar2[] = {2, 3, 8, 13};
int m = sizeof(ar1)/sizeof(ar1[0]);
int n = sizeof(ar2)/sizeof(ar2[0]);
merge(ar1, ar2, m, n);
cout << "After Merging nFirst Array: ";
for (int i=0; i<m; i++)
cout << ar1[i] << " ";
cout << "nSecond Array: ";
for (int i=0; i<n; i++)
cout << ar2[i] << " ";
return 0;
}