public class BucketSort {
public static void main(String[] args) {
int[] arr = {13,4,5,6,8,9,5,8,96,17,23,1,1};
sort(arr);
String output = "";
for (int i:arr) {
output += i + ",";
}
System.out.println(output);
}
private static void sort(int[] a) {
int max = 0;
for (int i : a) {
if (i > max) {
max = i;
}
}
sort(a, max);
}
private static void sort(int[] a, int max) {
int[] aux = new int[max + 1];
for (int i : a) {
aux[i]++;
}
int i = 0;
int j = 0;
while (i < aux.length) {
if (aux[i] > 0) {
a[j++] = i;
aux[i]--;
}
else {
i++;
}
}
}
}
[算法]BucketSort的Java实现
最新推荐文章于 2022-09-06 21:13:53 发布