1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44
| public class RadixSort {
public static void main(String[] args) { int[] arr = {422, 240, 115, 532, 305, 124}; int[] result = sort(arr); System.out.println(Arrays.toString(result));
}
private static int[] sort(int[] arr) { int[] result = new int[arr.length]; int[] count = new int[10];
for (int i = 0; i < 3; i++) { int division = (int) Math.pow(10, i); System.out.println(division); for (int j = 0; j < arr.length; j++) { int num = arr[j] / division % 10; System.out.println(num + " "); count[num]++; } System.out.println(); System.out.println(Arrays.toString(count)); for (int m = 0; m < count.length; m++) { count[m] = count[m] + count[m - 1]; } System.out.println(Arrays.toString(count));
for (int n = 0; n < arr.length; n++) { int num = arr[n] / division % 10;
}
}
return new int[0]; }
}
|
能否参与评论,且看个人手段。