// Java program to merge two sorted arrays
import java.util.*;
import java.lang.*;
import java.io.*;

class MergeTwoSorted
{
    // Merge arr1[0..n1-1] and arr2[0..n2-1]
    // into arr3[0..n1+n2-1]
    public static void mergeArrays(int[] arr1, int[] arr2, int n1,
                                int n2, int[] arr3)
    {
        int i = 0;
        int j = 0;
        int k = 0;

        while (i < n1 && j < n2){
            if (arr1[i] < arr2[j]){
                arr3[k] = arr1[i];
                i++;
                k++;
            }
            else {
                // if arr2 is smaller than arr1
                arr3[k] = arr2[j];
                k++;
                j++;
            }
        }
        if (i == n1) {
            while (j != n2) {
                arr3[k] = arr2[j];
                j++;
                k++;
            }
        }
        else {
            while (i != n1){
            arr3[k] = arr1[i];
                i++;
                k++;
            }
        }
    }

    public static void main (String[] args)
    {
        int[] arr1 = {1, 3, 5};
        int n1 = arr1.length;

        int[] arr2 = {2, 4, 6};
        int n2 = arr2.length;

        int[] arr3 = new int[n1+n2];

        mergeArrays(arr1, arr2, n1, n2, arr3);

        System.out.println("Array after merging");
        for (int i=0; i < n1+n2; i++)
            System.out.print(arr3[i] + " ");
    }
}