Java基数排序radixsort原理及用法解析

package cn.guizimo.sort;

import java.util.Arrays;

public class RadixSort {
  public static void main(String[] args) {
    int arr[] = {53,45,6,378,15,234,78};
    System.out.println("排序前");
    System.out.println(Arrays.toString(arr));
    radixSort(arr);
    System.out.println("排序后");
    System.out.println(Arrays.toString(arr));
  }

  public static void radixSort(int arr[]) {
    //获取最大位数
    int max = arr[0];
    for (int i = 1; i  max) {
        max = arr[i];
      }
    }
    //计算位数
    int maxLength = (max + "").length();

    int[][] bucket = new int[10][arr.length];
    int[] bucketElemtCounts = new int[10];

    for (int i = 0, n = 1; i 

package cn.guizimo.sort;

import java.util.Arrays;

public class RadixSort {
  public static void main(String[] args) {
    int max = 80000;
    int[] arr = new int[max];
    for (int i = 0; i  max) {
        max = arr[i];
      }
    }
    //计算位数
    int maxLength = (max + "").length();

    int[][] bucket = new int[10][arr.length];
    int[] bucketElemtCounts = new int[10];

    for (int i = 0, n = 1; i