C++ Program to Merge Two Sorted Arrays

// C++ program to merge two sorted arrays/ #include<iostream> using namespace std; // Merge arr1[0..n1-1] and arr2[0..n2-1] into // arr3[0..n1+n2-1] void mergeArrays(int arr1[], int arr2[], int n1,  int n2, int arr3[]) {  int i = 0, j = 0, k = 0;  // Traverse both array  while (i<n1 && j <n2)  {  // Check if current element of first  // array is smaller than current element  // of second array. If yes, store first  // array element and increment first array  // index. Otherwise do same with second array  if (arr1[i] < arr2[j])  arr3[k++] = arr1[i++];  else  arr3[k++] = arr2[j++];  }  // Store remaining elements of first array  while (i < n1)  arr3[k++] = arr1[i++];  // Store remaining elements of second array  while (j < n2)  arr3[k++] = arr2[j++]; } // Driver code int main() {  int arr1[] = {1, 3, 5, 7};  int n1 = sizeof(arr1) / sizeof(arr1[0]);  int arr2[] = {2, 4, 6, 8};  int n2 = sizeof(arr2) / sizeof(arr2[0]);  int arr3[n1+n2];  mergeArrays(arr1, arr2, n1, n2, arr3);  cout << "Array after merging" <<endl;  for (int i=0; i < n1+n2; i++)  cout << arr3[i] << " ";  return 0; } 

// C++ program to merge two sorted arrays  //using maps  #include<bits/stdc++.h> using namespace std; // Function to merge arrays void mergeArrays(int a[], int b[], int n, int m)  {  // Declaring a map.  // using map as a inbuilt tool  // to store elements in sorted order.  map<int, int> mp;    // Inserting values to a map.  for(int i = 0; i < n; i++)mp[a[i]]++;      for(int i = 0;i < m;i++)mp[b[i]]++;    // Printing keys of the map.  for(auto j: mp)  {  for(int i=0; i<j.second;i++)cout<<j.first<<" ";  } } // Driver Code int main() {   int a[] = {1, 3, 5, 7}, b[] = {2, 4, 6, 8};    int size = sizeof(a)/sizeof(int);  int size1 = sizeof(b)/sizeof(int);    // Function call  mergeArrays(a, b, size, size1);    return 0; } //This code is contributed by yashbeersingh42