JAVA 实现算法 - 插入排序

特点：
1、空间原址性

// 插入排序
Integer[] s = new Integer[]{10, 7, 19, 3, 6, 46, null};
for (int j = 1; j < s.length; j++) {
    Integer key = s[j];
    int i = j - 1;
    while (i >= 0 && key != null && s[i] > key) {
        s[i + 1] = s[i];
        i = i - 1;
    }
    s[i + 1] = key;
}
System.out.println(Arrays.asList(s));

输出：

[3, 6, 7, 10, 19, 46, null]