java数据结构和算法------希尔排序

package iYou.neugle.sort;

public class Shell_sort {
    public static void ShellSort(double[] array) {
        int n = array.length;
        for (int gap = n / 2; gap > 0; gap /= 2) {
            for (int i = gap; i < n; i++) {
                if (array[i] < array[i - gap]) {
                    double temp = array[i];
                    int j = i - gap;
                    while (j >= 0 && array[j] > temp) {
                        array[j + gap] = array[j];
                        j -= gap;
                    }
                    array[j + gap] = temp;
                }
            }
        }
    }
}