插入排序

for j == 2 to A.length
	key = A[j]
	
	i = j - 1
	while i > 0 and A[i] > key
		A[i+1] = A[i]
		i = i - 1
	A[i+1] = key

/**
     * 插入排序
     *
     * @param array 数组
     */
    private static void (int[] array) {
        for(int j = 2; j < array.length ; j++) {
            int key = array[j];
            int i = j - 1;
            while (i > 0 && array[i] > key) {
                array[i+1] = array[i];
                i--;
            }
            array[i+1] = key;
        }
    }