CTCI 11.1

You are given two sorted arrays, A and B, where A has a large enough buffer at the end to hold B. Write a method to merge B into A in sorted order.
1 5 8 9
2 6 8 10

CTCI 11.1.java

public static void merg(int[] A, int lengthA, int[] B){
    int current = lengthA + B.length - 1;
    int poA = lengthA - 1;
    int poB = B.length - 1;
    while(poA >= 0 && poB >= 0){
        if(A[poA] > B[poB]) A[current--] = A[poA--];
        else A[current--] = B[poB--];
    }
    while(poB >=0){
        A[current--] = B[poB--];
    }
}