class Solution {
public:
void merge(int A[], int m, int B[], int n) {
int aIndex=0,bIndex=0,aSize=m;
while(bIndex<n && aIndex<aSize)
{
if(A[aIndex]<=B[bIndex])
{
aIndex++;
}
else
{
for(int i=aSize-1;i>=aIndex;i--)
{
A[i+1]=A[i];
}
A[aIndex]=B[bIndex];
aSize++;
bIndex++;
}
}
while(bIndex<n)
{
A[aSize]=B[bIndex];
aSize++;
bIndex++;
}
}
};