桶式排序

import java.util.Arrays;
/**
 * 桶式排序
 * 
 * @author mk
 * 
 */
public class BucketSort
{
public static void sortBucket(DataWrap[] datas, int min, int max)
{
DataWrap[] tmp = new DataWrap[datas.length];
int[] buckets = new int[max - min];// 记录待排序元素的信息
// buckets数组记录DataWrap出现的次数
for (int i = 0; i < datas.length; i++) buckets[datas[i].getData() - min]++;

// 计算落入各个桶中的元素在有序序列的位置
for (int i = 1; i < max - min; i++) buckets[i] = buckets[i] + buckets[i - 1];


System.arraycopy(datas, 0, tmp, 0, datas.length);
// 根据buckets数组中信息将待排序的各个元素放入相应的位置
for (int j = datas.length - 1; j >= 0; j--) datas[--buckets[tmp[j].getData() - min]] = tmp[j];
}
public static void main(String[] args)
{
DataWrap[] dws = { new DataWrap(9, ""), new DataWrap(6, ""),
new DataWrap(1, ""), new DataWrap(3, ""),
new DataWrap(-3, ""), new DataWrap(9, ""),
new DataWrap(2, ""), new DataWrap(0, ""),
new DataWrap(10, "")};
System.out.println("排序前：" + Arrays.toString(dws));
sortBucket(dws, -3, 11);
System.out.println("排序后：" + Arrays.toString(dws));
/*
* 测试结果
* 排序前：[9, 6, 1, 3, -3, 9, 2, 0, 10]
* 排序后：[-3, 0, 1, 2, 3, 6, 9, 9, 10]
*/
}
}