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