http://oj.leetcode.com/problems/merge-sorted-array/

Merge Sorted Array.java

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