两个有序数组，找出相同的元素

public static void main(String[] args) {
        int[] m = {2, 4, 6, 9, 12, 13, 15, 16};
        int[] n = {3, 5, 9, 12, 15};
        Search(m, n);
    }

    private static void Search(int[] m, int[] n) {
        int minLength = Math.min(m.length, n.length);
        int i = 0, j = 0;
        while (j < minLength || i < minLength) {
            if (m[i] == n[j]) {
                System.out.println(m[i]);
                i++;
                j++;
            } else if (m[i] < n[j]) {
                i++;
            } else {
                j++;
            }
        }
    }