java希尔排序

public class ShellSort {

    public static void main(String[] args) {

        int a [] = { 9, 8, 7, 0, 1, 3, 2, 10, 5, 12, 7, 0, 15 };
        int n = a.length;

        for (int add = n / 2; add >= 1; add /= 2){
            for (int i = add; i < n; i++){
                int data = a[i];
                int j = i - add;
                for (; j >= 0; j -= add){
                    if (a[j] > data){
                        a[j + add] = a[j];
                    } else {
                        break;
                    }
                }
                a[j + add] = data;
            }
        }

        System.out.print("希尔排序结果：");
        for (int i = 0; i < n; i++){
            System.out.print(a[i] + ",");
        }
    }
}

结果：

希尔排序结果：0,0,1,2,3,5,7,7,8,9,10,12,15,