帮我写java桶排序

矫情吗；* 2024-03-26 10:18 35阅读 0赞

好的。

桶排序是一种非常快速的排序算法，它的时间复杂度是 O(n)。桶排序的思路是将数组分成若干个桶，然后将每个元素放入对应的桶中，再将每个桶中的元素进行排序，最后将所有桶中的元素按顺序依次取出来。

下面是一个 Java 代码示例：

\`\`\` import java.util.Arrays;

public class BucketSort \{ public static void sort(int\[\] array, int bucketSize) \{ if (array.length == 0) \{ return; \}

// 获取数组的最大值和最小值
        int max = array[0];
        int 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];
            }
        }
    
        // 初始化桶
        int bucketCount = (max - min) / bucketSize + 1;
        int[][] buckets = new int[bucketCount][bucketSize];
        int[] indexArr = new int[bucketCount];
        for (int i = 0; i < array.length; i++) {
            int bucketIndex = (array[i] - min) / bucketSize;
            if (indexArr[bucketIndex] == buckets[bucketIndex].length) {
                ensureCapacity(buckets, bucketIndex);
            }
            buckets[bucketIndex][indexArr[bucketIndex]++] = array[i];
        }
    
        // 对每个桶进行排序
        int k = 0;
        for (int i = 0; i < buckets.length; i++) {
            if (indexArr[i] == 0) {
                continue;
            }
            Arrays.sort(buckets[i], 0, indexArr[i]);
            for (int j = 0; j < indexArr[i]; j++) {
                array[k++] = buckets[i][j];
            }
        }
    }
    
    private static void ensureCapacity(int[][] buckets, int bucketIndex) {
        int[] tempArr = buckets[bucketIndex];
        int[] newArr = new int[tempArr.length * 2];
        for (int i = 0; i < tempArr.length; i++) {
            newArr