希尔排序

/**
 * 功能：希尔排序
 */
public class ShellSort {

    public int[] shellSort(int[] array) {

        int increment = array.length;
        int temp = 0;
        int index = 0;

        do {
            // 分组的步长
            increment = increment / 3 + 1;

            for (int i = increment; i < array.length; i++) {

                // 每一组数进行插入排序
                temp = array[i];
                index = i;
                for (int j = i - increment; j >= 0; j -= increment) {
                    if (array[j] > temp) {
                        array[j + increment] = array[j];
                        index = j;
                    }
                }
                array[index] = temp;
            }

        } while (increment > 1);

        return array;
    }
}