希尔排序算法

最新推荐文章于 2024-07-19 17:17:54 发布

风华的天空之城

最新推荐文章于 2024-07-19 17:17:54 发布

阅读量56

点赞数

分类专栏：初级算法文章标签：排序算法 java 算法

本文链接：https://blog.csdn.net/weixin_45370059/article/details/116405870

版权

初级算法专栏收录该内容

5 篇文章 0 订阅

订阅专栏

思想

基于插入排序的快速排序算法
数组中任意间隔h的元素都是有序的（h有序数组）
如果h很大，则元素移动很远。
(1)、 h 从1开始
(2)、 h < N / 3
(3)、 h = 3 * h + 1
h = 4

L	E	E	A	M	H	L	E	P	S	O	L	T	S	X	R
L	-	-	-	M	-	-	-	P	-	-	-	T
	E	-	-	-	H	-	-	-	S	-	-	-	S
		E	-	-	-	L	-	-	-	O	-	-	-	X
			A	-	-	-	E	-	-	-	L	-	-	-	R

实现

public class Shell {
    public static void sort(Comparable[] a) {
        int N = a.length;
        int h = 1;
        while (h < N / 3) {
            h = 3 * h + 1;
        }
        while (h >= 1) {
            for (int i = h; i < N; i++) {
                for (int j = i; j >= h && less(a[j], a[j-h]); j-= h) {
                    exch(a, j, j-h);
                }
            }
            h = h / 3;
        }
    }

    private static boolean less(Comparable v, Comparable w) {
        return v.compareTo(w) < 0;
    }

    private static void exch(Comparable[] a, int i, int j) {
        Comparable t = a[i];
        a[i] = a[j];
        a[j] = t;
    }

    private static boolean isSorted(Comparable[] a) {
        for (int i = 1; i < a.length; i++) {
            if (less(a[i], a[i - 1])) {
                return false;
            }
        }
        return true;
    }

    private static void show(Comparable[] a) {
        for (int i = 0; i < a.length; i++)
            System.out.print(a[i] + "    ");
        System.out.println();
    }

    public static void main(String[] args) {
        String[] a = {"S", "H", "E", "L", "L", "S", "O", "R", "T", "E", "X", "A", "M", "P", "L", "E"};

        Stopwatch time = new Stopwatch();
        sort(a);
        double timer = time.elapsedTime();
        if (isSorted(a)) {
            show(a);
            System.out.println("time: " + timer);
        } else {
            System.out.println("false");
        }
    }
}