基数排序（桶排序）（Java）

public class bucketsort {
    public static void main(String[] args) {
        int[] a = {1, 4, 3, 5, 2, 7, 12, 45, 13, 754, 124, 754, 6, 32, 45, 1};
        bucketsort bucketsort = new bucketsort();
        bucketsort.bucket(a);
        for (int b : a) System.out.println(b);
    }

    public void bucket(int[] a){
        int[][] buc= new int [10][a.length];
        int [] q = new int[10];
        int max = 0, maxleng = 0;
        for (int i = 0; i < a.length; i++) if(max