合并两个有序数组

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