桶式排序

桶式排序

《疯狂JAVA16课》看到桶式排序一直没弄懂，那就用程序来跑一下…

    public static void main(String[] args) {
        System.out.println("Hello World!");

        int[] data = new int[] { 5, 4, 2, 4, 1};
        print(data);
        bucketSort(data, 0, 6);
        print(data);
    }
    public static void bucketSort(int[] data, int min, int max) {
        // 缓存数组
        int[] tmp = new int[data.length];
        // buckets用于记录待排序元素的信息
        // buckets数组定义了max-min个桶
        int[] buckets = new int[max - min];
        // 计算每个元素在序列出现的次数
        for (int i = 0; i < data.length; i++) {
            buckets[data[i] - min]++;
        }
        //old_buckets=0,1,1,0,2,1
        // 计算“落入”各桶内的元素在有序序列中的位置
        for (int i = 1; i < max - min; i++) {
            buckets[i] = buckets[i] + buckets[i - 1];
            //i=1 = 1 + 0
            //i=2 = 1 + 1
            //i=3 = 2 + 0
            //i=4 = 2 + 2
            //i=5 = 4 + 1
        }
        //new_buckets=0,1,2,2,4,5
        // 将data中的元素完全复制到tmp数组中
        System.arraycopy(data, 0, tmp, 0, data.length);
        //tmp=5,4,2,4,1
        // 根据buckets数组中的信息将待排序列的各元素放入相应位置
        for (int k = data.length - 1; k >= 0; k--) {
            //k = 4; tmp[4] = 1; buckets[1] = 1;0data[0] = 1;
            //k = 3; tmp[3] = 4; buckets[4] = 4;3data[3] = 4;
            //k = 2; tmp[2] = 2; buckets[2] = 2;1data[1] = 2;
            //k = 1; tmp[1] = 4; buckets[4] = 3;2data[2] = 4;
            //k = 0; tmp[0] = 5; buckets[5] = 5;4data[4] = 5;
            data[--buckets[tmp[k] - min]] = tmp[k];
            //k = 3;buckets[4] = 4;--buckets[4];此时buckets[4] = 3
            //k = 1;buckets[4] = 3;注意坑
        }
    }

参考代码：
http://blog.csdn.net/apei830/article/details/6596057