使用存储桶排序创建降序的Java程序

import java.util.ArrayList;
import java.util.Collections;
import java.util.List;

public class BucketSort {
    public static void main(String[] args) {
        int[] array = {29, 25, 12, 49, 36, 8, 15};
        int maxValue = getMaxValue(array);
        bucketSort(array, maxValue);
        System.out.println("降序排序结果：");
        for (int num : array) {
            System.out.print(num + " ");
        }
    }

    private static void bucketSort(int[] array, int maxValue) {
        int bucketCount = maxValue / 10 + 1;
        List<List<Integer>> buckets = new ArrayList<>(bucketCount);
        for (int i = 0; i < bucketCount; i++) {
            buckets.add(new ArrayList<>());
        }

        for (int num : array) {
            int bucketIndex = num / 10;
            buckets.get(bucketIndex).add(num);
        }

        for (List<Integer> bucket : buckets) {
            Collections.sort(bucket, Collections.reverseOrder());
        }

        int index = 0;
        for (int i = bucketCount - 1; i >= 0; i--) {
            List<Integer> bucket = buckets.get(i);
            for (int num : bucket) {
                array[index++] = num;
            }
        }
    }

    private static int getMaxValue(int[] array) {
        int maxValue = Integer.MIN_VALUE;
        for (int num : array) {
            if (num > maxValue) {
                maxValue = num;
            }
        }
        return maxValue;
    }
}