Merge Sorted Array

    public void merge(int A[], int m, int B[], int n) {
        // Start typing your Java solution below
        // DO NOT write main() function
        int end = m + n - 1;
        m = m - 1;
        n = n - 1;
        while(m >= 0 && n >= 0) {
            if(A[m] > B[n]) A[end--] = A[m--];
            else A[end--] = B[n--];
        }
        while(n >= 0) A[end--] = B[n--];
    }