java基础算法之基数排序算法

        基数排序(桶排序)适用于非负整数,其原理是将整数按位数切割成不同的数字，然后按每个位数分别比较，典型的以空间换时间的 一种算法。

package com.example.datastructures.sort;

import java.util.Arrays;

/**
 * @author maoyouhua
 * @version jdk21
 *
 *          基数排序(桶排序)适用于整数,其原理是将整数按位数切割成不同的数字，然后按每个位数分别比较。
 */
public class RadixSort {
    /**
     *          空间换时间
     * @param arr
     */
    private static void radixSort(int[] arr){
        int[][] bucket = new int[10][arr.length];
        int[] bucketElementCounts = new int[10];

        int max = arr[0];
        for (int i = 1; i < arr.length; i++) {
            if (arr[i] > max) {
                max = arr[i];
            }
        }
        int maxLength = (max + "").length();
        for (int i = 0, n = 1; i < maxLength; i++, n *= 10) {
            for (int j = 0; j < arr.length; j++) {
                int digitOfElement = arr[j] / n % 10;
                bucket[digitOfElement][bucketElementCounts[digitOfElement]] = arr[j];
                bucketElementCounts[digitOfElement]++;
            }
            int index = 0;
            for (int k = 0; k < bucketElementCounts.length; k++) {
                if (bucketElementCounts[k] != 0) {
                    for (int l = 0; l < bucketElementCounts[k]; l++) {
                        arr[index++] = bucket[k][l];
                    }
                }
                bucketElementCounts[k] =  0;
            }
            System.out.println(Arrays.toString(arr));
        }
    }
    /**
     *      排序效率测试
     *      花费时间是：5毫秒
     */
    private static void efficiencyTest(){
        int capacity = 80000;
        int[] arr = new int[capacity];
        for (int i = 0; i < capacity; i++) {
            arr[i] = (int)(Math.random()  * 100 * capacity);
        }
        long start = System.currentTimeMillis();
        radixSort(arr);
        long end = System.currentTimeMillis();
        System.out.println("花费时间是：" + (end - start) + "毫秒");
    }

    /**
     *      [542, 53, 3, 14, 214, 748]
     *      [3, 14, 214, 542, 748, 53]
     *      [3, 14, 53, 214, 542, 748]
     * @param args
     */
    public static void main(String[] args) {
        int[] arr = {53,3,542,748,14,214};
        radixSort(arr);
        efficiencyTest();
    }

}