package com.dalingjia.Interview.sort;
/**
* 桶排序
*/
public class BucketSort {
public static void main(String[] args) {
int[] integer = new int[]{8, 2, 5, 4, 6, 2, 7, 1};
int[] integers = new int[11];//用来存放1~10
//把数组里的数放到对应数组角标里
for (Integer i : integer){
integers[i]++;
}
//打印
for (int i = 0; i < integers.length; i++) {
if(integers[i] != 0){
for (int j = 0; j < integers[i]; j++) {
System.out.print(i + ",");
}
}
}
}
}
常用排序算法之桶排序
最新推荐文章于 2023-05-03 08:55:19 发布