高级排序---希尔排序

import org.junit.Test;

import java.util.Arrays;
import java.util.Random;

public class ArraySh {

    @Test
    public void shTest(){
        int[] arr = new int[30];
        Random random = new Random();
        for(int i = 0;i < arr.length;i++){
            arr[i] = random.nextInt(1000);
        }
        System.out.println("未排序前数组：" + Arrays.toString(arr));

        arr = shellSort(arr);

        System.out.println("排序后数组：" + Arrays.toString(arr));
    }

    public int[] shellSort(int[] arr){
        int inner,outer,temp;
        int h = 1;
        while (h <= arr.length/3){
            h = h*3 +1;
        }
        while (h > 0){
            for(outer = h;outer < arr.length; outer++){
                temp = arr[outer];
                inner = outer;
                while (inner > h -1 && arr[inner - h] >= temp){
                    arr[inner] = arr[inner - h];
                    inner -= h;
                }
                arr[inner] = temp;
            }
            h = (h-1) /3;
        }
        return arr;

    }
}