希尔排序（JAVA实现）

/**
 * Created by DELL on 2017/4/23.
 * 希尔排序
 */
public class ShellInsertSort {
   public static void main(String[] args){
      // System.out.println("luan");
       int[] in = {46,12,25,33,33,68,19,80};
       int count = in.length;//该数组长度

       int[] countArr = new int[count/2];
      // System.out.println(countArr.length+"loolo");
       int j= 0;

       for(int i=count/2;i>=1;i/=2){
           countArr[j++] = i;
       }

       shellSort(in,countArr);
       for(int i=0;i<count;i++){
           System.out.print(in[i]+" ");
       }
   }
    public static void shellSort(int[] in,int[] countArr) {
        for (int i = 0; i < countArr.length; i++) {
           if(countArr[i]>0){
               ShellSort(in, countArr[i]);
           }
        }
    }
    public static void  ShellSort(int[] in,int d){
        int temp=0;
        int j=0;
        for(int i=d;i<in.length;i++){
            if(in[i]<in[i-d]){
                temp = in[i];
                for(j = i-d;j>=0&&(temp<in[j]);j-=d){
                    in[j+d] = in[j];

                }
                in[j+d] = temp;
            }
        }
    }

}