希尔排序

//希尔排序
	public static void shell(int a[]) {
		int N = a.length;
		for (int h = N/2;h>0;h/=2) {
				for (int i = h;i<N;i++) {
				for (int j = i ;j >=h&&a[j]<a[j-h];j-=h) {
					swap(a, j, j-h);
				}
			}
			System.out.println(Arrays.toString(a));
		
		}
		
	}