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
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65

public class RadixSort {
    public static void main(String[] args) {
        int[] arr = {49, 38, 65, 97, 26, 13, 27, 49, 55, 4};
        System.out.println("排序前:" + Arrays.toString(arr));

        radixsort(Arrays.copyOf(arr, arr.length));

    }

    



    private static void radixsort(int[] arr) {
        if (arr.length <= 1) {
            return;
        }
        
        int max = Arrays.stream(arr).max().getAsInt();
        int maxDight = String.valueOf(max).length();

        
        int[][] buckets = new int[10][arr.length];
        
        int base = 10;

        for (int i = 0; i < maxDight; i++) {
            
            int[] temp = new int[10];


            
            for (int j = 0; j < arr.length; j++) {
                
                int num = (arr[j] % base) / (base / 10);
                buckets[num][temp[num]] = arr[j];
                
                temp[num]++;

            }

            
            
            int k = 0;
            for (int b = 0; b < buckets.length; b++) {
                
                for (int p = 0; p < temp[b]; p++) {
                    arr[k++] = buckets[b][p];
                }
            }
            
            base *= 10;

        }

        System.out.println("排序后:" + Arrays.toString(arr));
    }
}