希尔排序图解

自己用Axure RP 画的希尔排序过程：

 

下面是代码：

public class Shell_sort {

	//希尔排序
	public static void main (String args[]){
		int a[] = {10,2,42,13,62,12,45,22,12,5};
		int n  = a.length;
		int temp;
		
		for(int D = n/2; D > 0; D/=2){
			for(int p = D;p < n; p++){
			int i;
			temp =  a[p];
			for(i = p; i >= D && a[i-D] > temp; i-=D)
				a[i] = a[i-D];
			a[i] = temp;
			}
		}
		for(int i = 0; i < n; i++){
			System.out.print(a[i]+" ");
		}
	}
}