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 mand n respectively.
class Solution {
public:
void merge(int A[], int m, int B[], int n) {
for(int ii = 0; ii < n; ii ++) {
int pos = 0;
while(pos < m && A[pos] < B[ii]) {
pos ++;
}
for(int jj = m; jj > pos; jj --) {
A[jj] = A[jj - 1];
}
A[pos] = B[ii];
m ++;
}
}
};