java的直接插入排序

Question

public static void main(String[] args) {
    int[] a = {1, 1234, 67, 65856, 234, 3, 4574, 11, 456, 3534};
    insertSorted(a);
    for (int i : a) {
        System.out.print(String.valueOf(i) + " ");
    }
}

public static void insertSorted(int[] a) {
    for (int i = 1; i < a.length; i++) {
        int num = a[i];//<<<<<<<<<<<<<<<<<<<<<----------------这里就是num
        int j;
        for (j = i; j > 0; j--) {
            if (a[j - 1] > a[i]) {//<<<--------------------就是这里的a[i]
                a[j] = a[j - 1];
            } else {
                break;
            }
        }
        a[j] = num;
    }
}

a[i]的时候打印结果:1 67 1234 234 3 4574 11 456 3534 65856 

替换成num的结果:1 3 11 67 234 456 1234 3534 4574 65856

a[i]应该等于num把,为什么会这样?

Answer 1

 public static void main(String[] args) {
        int[] a = {1, 1234, 67, 65856, 234, 3, 4574, 11, 456, 3534};
        insertSorted(a);
        for (int i : a) {
            System.out.print(String.valueOf(i) + " ");
        }
    }
    public static void insertSorted(int[] a) {
        for (int i = 1; i < a.length; i++) {
            int num = a[i];//<<<<<<<<<<<<<<<<<<<<<----------------这里就是num
            int j;
            for (j = i; j > 0; j--) {
//                if (a[j - 1] > a[i]) {//<<<--------------------就是这里的a[i]
                System.out.println(j + "," + a[i] + "," + num);
                if (a[j - 1] > num) {//<<<--------------------就是这里的a[i]
                    a[j] = a[j - 1];
                } else {
                    break;
                }
            }
            a[j] = num;
        }
    }

num只是用来存储当前a[i]的值，最后给a[j]，后面a[i]的值会一直改变