package test;
import java.util.HashSet;
import java.util.Set;
public class Test {
public static void main(String[] args) {
int[] arr = {1,5,6,3,9,8,6,4};
sort(arr);
System.out.println(arr);
}
private static void sort(int[] arr) {
if (arr.length == 0 || arr == null) {
return;
}
int[] ageTimeArr = new int[100];
for (int i = 0; i < 100;i++) {
ageTimeArr[i] = 0;
}
for (int i = 0; i < arr.length;i++) {
++ageTimeArr[arr[i]];
}
int index = 0;
for (int i = 0 ;i < 100;i++) {
for (int j = 0;j < ageTimeArr[i];j++) {
arr[index] = i;
index++;
}
}
}
}
一个时间复杂度为O(n)的排序算法,空间复杂度为O(1)
最新推荐文章于 2023-02-21 13:17:17 发布