我为最高有效基数排序编写了代码,但在以下行中不断出现IndexBoundsException错误:arr[I]=arr1.get(I);。现在我不知道出了什么问题,因为逻辑对我来说似乎是正确的
public static int[] msdRadixSort(int[] arr) {
if (arr == null) {
throw new IllegalArgumentException("The array is null!");
}
//search through to find msd
int temp = arr[0];
for (int i = 0; i < arr.length; i++) {
if (Math.abs(temp) <= Math.abs(arr[i])) {
temp = arr[i];
}
}
//find the length of the msd
int k = 1;
while (!(temp / 10 == 0)) {
temp = temp / 10;
k++;
}
ArrayList<Integer> arr1 = new ArrayList<Integer>(arr.length);
for (int i = 0; i < arr.length; i++) {
arr1.add(arr[i]);
}
msdRadixSort(arr1, k);
System.out.println(arr1);
for (int i = 0; i < arr.length; i++) {
arr[i] = arr1.get(i);
}
return arr;
}
嵌套循环不正确,应该是
for (int j = 0; j < bucket.length; j++) {
for (int i = 0; i < bucket[j].size(); i++) {
arr.add(bucket[j].get(i));
}
}