7.基数排序
7.1实现思路
7.2具体实现
1.第一轮排序
public class RadixSort {
public static void main(String[] args) {
int[] arr = { 5, 234, 34, 48, 135, 3 };
radixSort(arr);
System.out.println("第一轮,对个位数的排序处理:" + Arrays.toString(arr));
}
public static void radixSort(int[] arr) {
int[][] bucket = new int[10][arr.length];
int[] bucketElemetnCounts = new int[10];
for (int j = 0; j < arr.length; j++) {
int digitOfElement = arr[j] % 10;
bucket[digitOfElement][bucketElemetnCounts[digitOfElement]] = arr[j];
bucketElemetnCounts[digitOfElement]++;
}
int index = 0;
for (int k = 0; k < bucketElemetnCounts.length; k++) {
if (bucketElemetnCounts[k] != 0) {
for (int l = 0; l < bucketElemetnCounts[k]; l++) {
arr[index] = bucket[k][l];
index++;
}
}
}
}
}
第一轮,对个位数的排序处理:[3, 234, 34, 5, 135, 48]
2.第二轮排序
public class RadixSort {
public static void main(String[] args) {
int[] arr = { 5, 234, 34, 48, 135, 3 };
radixSort(arr);
}
public static void radixSort(int[] arr) {
int[][] bucket = new int[10][arr.length];
int[] bucketElemetnCounts = new int[10];
for (int j = 0; j < arr.length; j++) {
int digitOfElement = arr[j] % 10;
bucket[digitOfElement][bucketElemetnCounts[digitOfElement]] = arr[j];
bucketElemetnCounts[digitOfElement]++;
}
int index = 0;
for (int k = 0; k < bucketElemetnCounts.length; k++) {
if (bucketElemetnCounts[k] != 0) {
for (int l = 0; l < bucketElemetnCounts[k]; l++) {
arr[index] = bucket[k][l];
index++;
}
}
bucketElemetnCounts[k] = 0;
}
System.out.println("第一轮,对个位数的排序处理:" + Arrays.toString(arr));
int[][] bucket1 = new int[10][arr.length];
int[] bucketElemetnCounts1 = new int[10];
for (int j = 0; j < arr.length; j++) {
int digitOfElement = arr[j] / 10 % 10;
bucket1[digitOfElement][bucketElemetnCounts1[digitOfElement]] = arr[j];
bucketElemetnCounts1[digitOfElement]++;
}
index = 0;
for (int k = 0; k < bucketElemetnCounts1.length; k++) {
if (bucketElemetnCounts1[k] != 0) {
for (int l = 0; l < bucketElemetnCounts1[k]; l++) {
arr[index] = bucket1[k][l];
index++;
}
}
bucketElemetnCounts[k] = 0;
}
System.out.println("第二轮,对十位数的排序处理:" + Arrays.toString(arr));
}
}
第一轮,对个位数的排序处理:[3, 234, 34, 5, 135, 48]
第二轮,对十位数的排序处理:[3, 5, 234, 34, 135, 48]
3.第三轮
public class RadixSort {
public static void main(String[] args) {
int[] arr = { 5, 234, 34, 48, 135, 3 };
radixSort(arr);
}
public static void radixSort(int[] arr) {
int[][] bucket = new int[10][arr.length];
int[] bucketElemetnCounts = new int[10];
for (int j = 0; j < arr.length; j++) {
int digitOfElement = arr[j] % 10;
bucket[digitOfElement][bucketElemetnCounts[digitOfElement]] = arr[j];
bucketElemetnCounts[digitOfElement]++;
}
int index = 0;
for (int k = 0; k < bucketElemetnCounts.length; k++) {
if (bucketElemetnCounts[k] != 0) {
for (int l = 0; l < bucketElemetnCounts[k]; l++) {
arr[index] = bucket[k][l];
index++;
}
}
bucketElemetnCounts[k] = 0;
}
System.out.println("第一轮,对个位数的排序处理:" + Arrays.toString(arr));
int[][] bucket1 = new int[10][arr.length];
int[] bucketElemetnCounts1 = new int[10];
for (int j = 0; j < arr.length; j++) {
int digitOfElement = arr[j] / 10 % 10;
bucket1[digitOfElement][bucketElemetnCounts1[digitOfElement]] = arr[j];
bucketElemetnCounts1[digitOfElement]++;
}
index = 0;
for (int k = 0; k < bucketElemetnCounts1.length; k++) {
if (bucketElemetnCounts1[k] != 0) {
for (int l = 0; l < bucketElemetnCounts1[k]; l++) {
arr[index] = bucket1[k][l];
index++;
}
}
bucketElemetnCounts[k] = 0;
}
System.out.println("第二轮,对十位数的排序处理:" + Arrays.toString(arr));
int[][] bucket2 = new int[10][arr.length];
int[] bucketElemetnCounts2 = new int[10];
for (int j = 0; j < arr.length; j++) {
int digitOfElement = arr[j] / 100 % 10;
bucket2[digitOfElement][bucketElemetnCounts2[digitOfElement]] = arr[j];
bucketElemetnCounts2[digitOfElement]++;
}
index = 0;
for (int k = 0; k < bucketElemetnCounts2.length; k++) {
if (bucketElemetnCounts2[k] != 0) {
for (int l = 0; l < bucketElemetnCounts2[k]; l++) {
arr[index] = bucket2[k][l];
index++;
}
}
}
System.out.println("第三轮,对百位数的排序处理:" + Arrays.toString(arr));
}
}
第一轮,对个位数的排序处理:[3, 234, 34, 5, 135, 48]
第二轮,对十位数的排序处理:[3, 5, 234, 34, 135, 48]
第三轮,对百位数的排序处理:[3, 5, 34, 48, 135, 234]
4.代码优化
public class RadixSort1 {
public static void main(String[] args) {
int[] arr = { 5, 234, 34, 48, 135, 3 };
radixSort(arr);
System.out.println(Arrays.toString(arr));
}
public static void radixSort(int[] arr) {
int[][] bucket = new int[10][arr.length];
int[] bucketElemetnCounts = new int[10];
int max = 0;
for (int i = 0; i < arr.length; i++) {
if (arr[i] > max) {
max = arr[i];
}
}
int maxLength = (max + "").length();
for (int j = 0, n = 1; j < maxLength; j++, n *= 10) {
for (int l = 0; l < arr.length; l++) {
int digitOfElement = arr[l] / n % 10;
bucket[digitOfElement][bucketElemetnCounts[digitOfElement]] = arr[l];
bucketElemetnCounts[digitOfElement]++;
}
int index = 0;
for (int k = 0; k < bucketElemetnCounts.length; k++) {
if (bucketElemetnCounts[k] != 0) {
for (int l = 0; l < bucketElemetnCounts[k]; l++) {
arr[index] = bucket[k][l];
index++;
}
}
bucketElemetnCounts[k] = 0;
}
}
}
}
[3, 5, 34, 48, 135, 234]
7.3测试基数排序算法的速度
public class RadixSort1 {
public static void main(String[] args) {
int[] arr = new int[80000];
for (int i = 0; i < 80000; i++) {
arr[i] = (int) (Math.random() * 800000);
}
Date date1 = new Date();
SimpleDateFormat simpleDateFormat1 = new SimpleDateFormat("yyyy-MM-dd HH:mm:ss");
String format1 = simpleDateFormat1.format(date1);
System.out.println("排序前的时间是:" + format1);
radixSort(arr);
Date date2 = new Date();
SimpleDateFormat simpleDateFormat2 = new SimpleDateFormat("yyyy-MM-dd HH:mm:ss");
String format2 = simpleDateFormat2.format(date2);
System.out.println("排序后的时间是:" + format2);
}
public static void radixSort(int[] arr) {
int[][] bucket = new int[10][arr.length];
int[] bucketElemetnCounts = new int[10];
int max = 0;
for (int i = 0; i < arr.length; i++) {
if (arr[i] > max) {
max = arr[i];
}
}
int maxLength = (max + "").length();
for (int j = 0, n = 1; j < maxLength; j++, n *= 10) {
for (int l = 0; l < arr.length; l++) {
int digitOfElement = arr[l] / n % 10;
bucket[digitOfElement][bucketElemetnCounts[digitOfElement]] = arr[l];
bucketElemetnCounts[digitOfElement]++;
}
int index = 0;
for (int k = 0; k < bucketElemetnCounts.length; k++) {
if (bucketElemetnCounts[k] != 0) {
for (int l = 0; l < bucketElemetnCounts[k]; l++) {
arr[index] = bucket[k][l];
index++;
}
}
bucketElemetnCounts[k] = 0;
}
}
}
}
排序前的时间是:2021-01-09 21:03:18
排序后的时间是:2021-01-09 21:03:18