排序算法(桶排)

时间复杂度最少的排序算法之一桶排，线性阶，具体源码如下：

public class TongPai {

/**
* 排序，桶排，时间复杂度线性阶
* 2016/5/4/14:32
* 软件1404
* 秃小驴
*/
public static void main(String[] args) {
// TODO Auto-generated method stub

int[] arr = new int[]{-2,10,4,33,99,-9,80,66,10};
int max = findMax(arr);
int min = findMin(arr);

int cha = max - min; //所要排序数组的最大值和最小值的差;
int[] tong = new int[cha+1];

//创造桶 每个桶付初始值0;
for (int i = 0; i < tong.length; i++) {
tong[i] = 0;
}

for (int i = 0; i < arr.length; i++) {
tong[arr[i]-min]++;
}
for (int i = 0; i < tong.length; i++) {
while (tong[i] != 0) {
System.out.printf("%d\t",i+min);
tong[i]--;
}
}
}

//求出所要排序数组的最大值
public static int findMax(int[] arr){
int max = arr[0];
for (int i = 1; i < arr.length; i++) {
if (max < arr[i]) {
max = arr[i];
}
}
return max;
}

//求出所要排序数组的最小值
public static int findMin(int[] arr){
int min = arr[0];
for (int i = 1; i < arr.length; i++) {
if (min > arr[i]) {
min = arr[i];
}
}
return min;
}

}