mergeSortedArrays.java

//Question: Merge two sorted arrays in a single sorted array.
package arrays;

public class mergeSortedArrays {
    public static void main(String[] args) {
        int[] a={20, 32, 55, 69};
        int[] b={11, 27, 43, 75, 89};
        int[] arr=new int[a.length+b.length];
        int i=0, j=0, k=0;
      while(i<a.length && j<b.length){  // Main Algorithm
        if(a[i]<=b[j]){
            arr[k]=a[i];
            i++;
            k++;
        }else{  // b[j]<=a[i]
            arr[k]=b[j];
            k++;
            j++;
        }
      }
      if(i==a.length){  // If a array's elements are end. Now take elements from b only.
       while(j<b.length){ 
        arr[k]=b[j];
        k++;
        j++;
       }
      }
      if(j==b.length){  // If b array's elements are end. Now take elements from a only.
        while(i<a.length){
            k++;
            i++;
        }
      }
             for(int ele : arr){
        System.out.print(ele+" ");
  }
    }
}