测试希尔排序【交换法】对100000个数据排序花费的时间

import java.text.SimpleDateFormat;
import java.util.Date;

public class ShellSort {

    public static void main(String[] args) {
        int[] array = new int[100000];
        for (int i = 0; i < 100000; i++) {
            array[i] = (int) (Math.random() * 1000000);
        }
        Date start = new Date();
        SimpleDateFormat simpleDateFormat = new SimpleDateFormat("yyyy-MM-dd HH:mm:ss");
        System.out.println("start   :"+simpleDateFormat.format(start));
        shellSort(array);
        Date end = new Date();
        System.out.println("end   :"+simpleDateFormat.format(end));
    }

    /*
    交换法
     */
    public static void shellSort(int[] array) {
        int len = array.length;
        int temp = 0;
        for (int gap = len / 2; gap >= 1; gap /= 2) {
            for (int i = gap; i < len; i++) {
                for (int j = i - gap; j >= 0; j -= gap) {
                    if(array[j] > array[j+gap]){
                        array[j] = array[j] + array[j+gap] - (array[j+gap] = array[j]);
                    }
                }
            }
        }
    }

}