十大排序算法之六：希尔排序

漫画：什么是希尔排序？

1 希尔排序

1.1 原理

为减少插入排序的工作量，可以从两方面着手进行预处理：

• 在大多数元素已经有序的情况下，插入排序的工作量较小。
• 在元素数量较少的情况下，插入排序的工作量较小。

希尔排序=预处理+插入排序。

1.2 实现

import java.util.Arrays;

/**
 * 希尔排序
 *
 * @author wgm
 * @since 2021/4/18
 */
public class ShellSort {

    public static void main(String[] args) {
        int[] ints = {99, 100, -30, 0, 99, 2, -2, -15, 2, 2, 333, 666, 999, 27, 22, 13, 8, 7, 2, -30};
        System.out.println("排序前：" + Arrays.toString(ints));
        System.out.println("排序后：" + Arrays.toString(shellSort(ints)));
    }

    private static int[] shellSort(int[] ints) {
        if (ints == null || ints.length <= 1) {
            return ints;
        }

        /*
        以下代码由插入排序修改而来。先实现插入排序，再修改为希尔排序。
         */
        int member = 2; // 组员2个
        int group = ints.length / member; // 组数（组间间隔）
        while (member <= ints.length && group >= 1) {
            for (int i = group; i <= ints.length - 1; i++) {
                int temp = ints[i];
                int j = i - group;
                while (j >= 0 && ints[j] > temp) {
                    ints[j + group] = ints[j];
                    j -= group;
                }
                j += group;
                ints[j] = temp;
            }
            member *= 2; // 组员倍增
            group = ints.length / member; // 组数（组间间隔）
        }
        return ints;
    }
}

1.3 测试

D:\program\Java\jdk1.8.0_241\bin\java.exe -agentlib:jdwp=transport=dt_socket,address=127.0.0.1:62742,suspend=y,server=n "-javaagent:C:\Users\GMWANG~1\AppData\Local\Temp\captureAgent956jars\debugger-agent.jar" -Dfile.encoding=UTF-8 -classpath "D:\program\Java\jdk1.8.0_241\jre\lib\charsets.jar;D:\program\Java\jdk1.8.0_241\jre\lib\deploy.jar;D:\program\Java\jdk1.8.0_241\jre\lib\ext\access-bridge-64.jar;D:\program\Java\jdk1.8.0_241\jre\lib\ext\cldrdata.jar;D:\program\Java\jdk1.8.0_241\jre\lib\ext\dnsns.jar;D:\program\Java\jdk1.8.0_241\jre\lib\ext\jaccess.jar;D:\program\Java\jdk1.8.0_241\jre\lib\ext\jfxrt.jar;D:\program\Java\jdk1.8.0_241\jre\lib\ext\localedata.jar;D:\program\Java\jdk1.8.0_241\jre\lib\ext\nashorn.jar;D:\program\Java\jdk1.8.0_241\jre\lib\ext\sunec.jar;D:\program\Java\jdk1.8.0_241\jre\lib\ext\sunjce_provider.jar;D:\program\Java\jdk1.8.0_241\jre\lib\ext\sunmscapi.jar;D:\program\Java\jdk1.8.0_241\jre\lib\ext\sunpkcs11.jar;D:\program\Java\jdk1.8.0_241\jre\lib\ext\zipfs.jar;D:\program\Java\jdk1.8.0_241\jre\lib\javaws.jar;D:\program\Java\jdk1.8.0_241\jre\lib\jce.jar;D:\program\Java\jdk1.8.0_241\jre\lib\jfr.jar;D:\program\Java\jdk1.8.0_241\jre\lib\jfxswt.jar;D:\program\Java\jdk1.8.0_241\jre\lib\jsse.jar;D:\program\Java\jdk1.8.0_241\jre\lib\management-agent.jar;D:\program\Java\jdk1.8.0_241\jre\lib\plugin.jar;D:\program\Java\jdk1.8.0_241\jre\lib\resources.jar;D:\program\Java\jdk1.8.0_241\jre\lib\rt.jar;D:\project\untitled\out\production\untitled;D:\program\JetBrains\IntelliJ IDEA 2020.1\lib\idea_rt.jar" ShellSort
Connected to the target VM, address: '127.0.0.1:62742', transport: 'socket'
排序前：[99, 100, -30, 0, 99, 2, -2, -15, 2, 2, 333, 666, 999, 27, 22, 13, 8, 7, 2, -30]
排序后：[-30, -30, -15, -2, 0, 2, 2, 2, 2, 7, 8, 13, 22, 27, 99, 99, 100, 333, 666, 999]
Disconnected from the target VM, address: '127.0.0.1:62742', transport: 'socket'

Process finished with exit code 0

2 希尔增量

• Hibbard增量：通项公式为2^k-1，最坏时间复杂度是O(n^3/2)
• Sedgewick增量：通项公式为9×4^k-9×2^k+1或者4^k-3×2^k+1，最坏时间复杂度是O(n^4/3)