浅析java 希尔排序(Shell)算法

package com.zc.manythread;

/**

 *

 * @author 偶my耶

 *

 */

public class ShellSort {

    public static int count = 0;

    public static void shellSort(int[] data) {

        // 计算出最大的h值

        int h = 1;

        while (h <= data.length / 3) {

            h = h * 3 + 1;

        }

        while (h > 0) {

            for (int i = h; i < data.length; i += h) {

                if (data[i] < data[i - h]) {

                    int tmp = data[i];

                    int j = i - h;

                    while (j >= 0 && data[j] > tmp) {

                        data[j + h] = data[j];

                        j -= h;

                    }

                    data[j + h] = tmp;

                    print(data);

                }

            }

            // 计算出下一个h值

            h = (h - 1) / 3;

        }

    }

    public static void print(int[] data) {

        for (int i = 0; i < data.length; i++) {

            System.out.print(data[i] + "\t");

        }

        System.out.println();

    }

    public static void main(String[] args) {

        int[] data = new int[] { 4, 3, 6, 2, 1, 9, 5, 8, 7 };

        print(data);

        shellSort(data);

        print(data);

    }

}