Merge 2 Sorted Array
123456789101112131415161718192021222324252627282930313233343536373839404142
#include <iostream>
//include<string.h>
//#include<stdio.h>
using namespace std;
void mergeArray(int arr1[],int arr2[])
{
int n1 = sizeof(arr1) / sizeof(arr1[0]);
int n2 = sizeof(arr2) / sizeof(arr2[0]);
int arr3[n1+n2];
int i=0,j=0,k=0;
while(i<n1 && j<n2)
{
if (arr1[i] < arr2[j])
arr3[k++] = arr1[i++];
else
arr3[k++] = arr2[j++];
}
while (i < n1) //store remaining elements of Array 1
arr3[k++] = arr1[i++];
while (j < n2) //store remaining elements of Array 2
arr3[k++] = arr2[j++];
cout << "Array after merging" <<endl;
for (int i=0; i < (n1+n2); i++)
cout << arr3[i] << " ";
//cout<< sizeof(arr3);
}
int main() {
int arr1[] = {1,1,3, 5, 7};
int arr2[] = {2,3, 4, 6, 8};
mergeArray(arr1,arr2);
return 0;
}
Cpp
INFO