希爾排序
public class ShellSort {
public static void shellsort(int [] a){
int i,j,temp;
int gap=5;
do{
gap=gap/3+1;
for( i=gap;i<a.length ;i++){
if(a[i]<a[i-gap]){
temp=a[i];
for( j=i-gap;a[j]>temp;j-=gap){
a[j+gap]=a[j];
}
a[j+gap]=temp;
}
}
}while(gap>1);
for(int k=0;k<a.length ;k++){
System.out.print(a[k]+" ");
}
}
public static void main(String[] args) {
int [] a ={0,1,2,3,0,9,8,7,6,5,4};
shellsort(a);
}
}