希尔插入排序

import java.util.Arrays;

public class XiErPaiXu {
    public static void main(String[] args) {
        int[] a=new int []{34,24,65,11,33,62,15,98,3,4,7,1,5,2,73,13,52,13};
       int d=a.length/2;
        while (true){
            d=(int)d/2;
            for (int k=0;k
                //作业优化
                for (int i=0;ilength;i++) {
                    int temp = a[i];//待插入
                    int index = i;
                    for (; index > 0 && a[index - 1] > temp; index--) {
                        a[index] = a[index - 1];
                    }
                    a[index] = temp;
                }}

            if (d==1){
                break;
            }
        }
        for (int num:a){
            System.out.print(num+"\t");
        }
    }}