Java实现桶排序

import java.util.Arrays;
import java.util.LinkedList;
import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner cin = new Scanner(System.in);
        int n = cin.nextInt();
        int max = 10000;
        int x;
        int []count = new int[max+1];
        Arrays.fill(count, 0);
        for (int i = 0; i < n; i++){
            x = cin.nextInt();
            count[x]++;
        }
        boolean flag = false;
        for (int i = 0; i <= max; i++){
            while (count[i] > 0){
                if (!flag){
                    System.out.print(i);
                    flag = true;
                }else {
                    System.out.print( " " + i);
                }
                count[i]--;
            }
        }
        System.out.println();
    }
}

  

 

  
1
  
2
  
3
  
4
  
5
  
6
  
7
  
8
  
9
  
10
  
11
  
12
  
13
  
14
  
15
  
16
  
17
  
18
  
19
  
20
  
21
  
22
  
23
  
24
  
25
  
26
  
27
  
28
  
29
  
30
  
31
 

文章来源: blog.csdn.net，作者：爱玲姐姐，版权归原作者所有，如需转载，请联系作者。

原文链接：blog.csdn.net/jal517486222/article/details/86497032