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 andn respectively.

class Solution {
public:
    void merge(int A[], int m, int B[], int n) {
        int index=m+n-1;
        int endA=m-1;
        int endB=n-1;
        while(index>=0)
        {
            if(endA==-1 || (endB!=-1 && A[endA]<B[endB]))
            {
                A[index]=B[endB];
                endB--;
            }
            else
            {
                if(index!=endA)
                    A[index]=A[endA];
                endA--;
            }
            index--;
        }
    }
};