public class BucketSort{
    Scanner in = new Scanner(System.in);
    
    public void bucketSort(int array[], int numBuckets){
      
        System.out.println("选择排序顺序：");
        System.out.println("[A] 升序 \n[D] 降序 \n 输入选择: ");
        char choice2 = in.next().charAt(0);
        
        if (choice2 == 'A') {
            List<Integer>[] buckets = new List[numBuckets];
            System.out.println("用户输入的值为 " + Arrays.toString(array));
            System.out.println("算法选择为桶排序");
            System.out.println("排序顺序选择为升序");
            
            // 创建空的桶
            for(int i = 0; i < numBuckets; i++){
                buckets[i] = new LinkedList<>();
            }
            
            for(int num : array){
                buckets[hash(num, numBuckets)].add(num);
            }
            
            for(List<Integer> bucket : buckets) {
                Collections.sort(bucket);
            }
            
            int i = 0;
            for(List<Integer> bucket : buckets) {
                for (int num : bucket){
                    array[i++] = num;
                }
            }
        }
        
        // 在这里实现降序排序的部分
        
    }
    
    private static int hash(int num, int numBuckets) {
        return num / numBuckets;
    }
}

Collections.sort(bucket, Collections.reverseOrder());

for(int index = buckets.length - 1; index >= 0; index--) {
    for (int num: buckets[index]){
       array[i++] = num;
    }
}