Java桶排序代码实现

 public static void bucketSort(int [] a,int bucketSize){
        if (a.length<2)return;

        int minIndex = a[0];
        int maxIndex = a[1];
        for (int i=0;ia[i]) minIndex = a[i];
        }

        int bucketCount = (maxIndex-minIndex)/bucketSize+1;
        int [][] buckets = new int[bucketCount][bucketSize];
        int [] indexArr = new int[bucketCount];

        for (int i=0;i=r)return;
        int q = partition(a,p,r);
        quickSort(a,p,q-1);
        quickSort(a,q+1,r);
    }

    private static int partition(int[] a, int p, int r) {
        int pivot = a[r];
        int i = p;
        for (int j=p;j