希尔排序 java实现

package org.ys.shellSort;
public class shellSort {
	public static void main(String[] args) {
		int a[]={1,23,42,34,53,62,2,26,37,28,39};
		double d1=a.length;
		int temp = 0;
		while(true){
			d1=Math.ceil(d1/2);
			int d=(int)d1;
			for(int x=0;x<d;x++){
				for(int i=x+d;i<a.length;i+=d){
					int j= i-d;
					temp =a[i];
					for(;j>=0&&temp<a[j];j-=d){
						a[j+d]=a[j];
					}
					a[j+d]=temp;
				}			
			}
			if(d==1)
				break;
		}
		for(int i=0;i<a.length;i++)
			{System.out.print(a[i]);
		    System.out.print(" ");}
	}

}