桶排序

桶排序就是将数据分在不同的区间中，然后每个区间排序，最后在合并成一个完整的有序数列，代码实现如下:

import java.util.LinkedList;

/**
 * @Author qucg
 * @Version 2019/5/27
 * @Description 桶排序
 * 区间跨度：(最大值-最小值)/(桶数量-1)
 * 桶的个数等于元素的个数
 */
public class BuckSort {
    public static double[] bucketSort(double[] array) {
        // 1.得到数列的最大值和最小值，并算出差值d
        double max = array[0];
        double min = array[0];
        for (int i = 1; i < array.length; i++) {
            if (array[i] > max) {
                max = array[i];
            }
            if (array[i] < min) {
                min = array[i];
            }
        }
        double d = max - min;

        // 2.初始化桶
        int buckNum = array.length;
        ArrayList<LinkedList<Double>> bucketList = new ArrayList<LinkedList<Double>>(buckNum);
        for (int i = 0; i < buckNum; i++){
            bucketList.add(new LinkedList<Double>());
        }

        // 3.遍历原始数组，将每个元素放入桶中
        for (int i = 0; i < array.length; i++) {
        // 这里可以这么理解  (array[i]-min)/d * (buckNum-1) = num
            int num = (int) ((array[i] - min) * (buckNum - 1) / d);
            bucketList.get(num).add(array[i]);
        }
        // 4.对每个桶内部进行排序
        for (int i = 0; i < bucketList.size(); i++) {
            // jdk底层采用了归并排序或归并的优化版本
            Collections.sort(bucketList.get(i));
        }

        // 5.输出全部元素
        double[] sortedArray = new double[array.length];
        int index = 0;
        for (LinkedList<Double> list : bucketList) {
            for (double element : list) {
                sortedArray[index] = element;
                index++;
            }
        }
        return sortedArray;
    }

    public static void main(String[] args) {
        double[] array = new double[]{4.12, 6.421, 0.0023, 3.0, 2.123, 8.122, 4.12, 10.09};
        double[] sortedArray = bucketSort(array);
        System.out.println(Arrays.toString(sortedArray));
    }
}

桶排序的时间和空间复杂度都为o(n)