希尔排序

package sort;
import java.util.Arrays;
public class TestShellSortDemo {
    public static void shellSort(int [] array){
        //产生组的概念
        int [] d={5};
        for(int i=0;i<d.length;i++){
            shell(array,d[i]);
        }
    }
    //每一组进行直接插入排序
    public static void shell(int[]array,int gap){
        int tmp = 0;
        int i = 0;
        int j = 0;
        for( i = gap;i < array.length;i++){//这里一定注意是i++，如果是i+=gap就会让剩下的几组没有排
            tmp=array[i];
            for( j = i-gap;j>=0;j-=gap){
                if(array[j]>tmp){
                    array[j+gap]=array[j];
                }else{
                    break;
                }
            }
            array[j+gap]=tmp;
        }
        
    }
    public static void main(String[] args) {
        // TODO Auto-generated method stub
        int[]array={22,77,99,11,55,33,66,88,44,55,23,12,54,16,87};
        shellSort(array);
        System.out.println(Arrays.toString(array));
    }

}