layout: post
category : 算法
title : shell 排序
tagline:

[algorithm]

{% include JB/setup %}

希尔排序

public void shellSort2(int[] list) {
        int gap = list.length / 2;
        while (gap >= 1) {
        //插入排序
            for (int i = gap; i < list.length; i++) {
                for (int j = i - gap; j >= 0 && list[j + gap] < list[j]; j = j
                        - gap) {
                    int temp = list[j];
                    list[j] = list[j + gap];
                    list[j + gap] = temp;
                }
            }
            System.out.format("gap=%d:\t", gap);
            for (int v : list) {
                System.out.print(v + "\t");
            }
            System.out.println();
            gap = gap / 2;
        }
    }

插入排序

    public static void insertSort(int a[]) {
        int i, j;
        int[] b;
        for (i = 1; i < a.length; i++) {
            for (j = i - 1; j >= 0 && a[j] > a[j + 1]; j--) {
                int temp = a[j];
                a[j] = a[j + 1];
                a[j + 1] = temp;
            }
        }
        return b = a;
    }