按照算法笔记给的伪代码写了实现如下：?

public static int[] order(int[] array) {
		int n = array.length; 
		int i=0;
		int j = n ;
		int k = 0 ;
		float s = 1.3f ;
		boolean flag = false ;
		while ( j > 1 || flag == true) {
			i = 0 ;
			j = (int) Math.max(Math.floor(j/s), 1);
			flag = false ;
			while(i + j < n) {
				if(array[i]>array[i+j]) {
					k = array[i];
					array[i] = array[i+j];
					array[i+j] = k;
					flag = true ;
				}
				i++ ;
			}
		}
		return array;
	}

?