Merge Sorted Array

Given two sorted integer arrays A and B, merge B into A as one sorted array.

Note:
You may assume that A has enough space (size that is greater or equal to m + n) to hold additional elements from B. The number of elements initialized in A and B are m and n respectively.

public class Solution {
    public void merge(int A[], int m, int B[], int n) {
        int i=m;
        int j=n;
        int k=m+n;
        while(i!=0&&j!=0){
            if(A[i-1]<B[j-1]){
                A[k-1]=B[j-1];
                j--;
            }else{
                A[k-1]=A[i-1];
                i--;
            }
            k--;
        }
        if(j>0){
            for(int e=0;e<j;e++){
                A[e]=B[e];
            }
        }
    }
}