数据结构八种基本序列代码---基数排序

package sorting;

import java.util.ArrayList;
import java.util.List;

public class RadixSort { //基数排序
     private static void sort(int[] array) {
         //找到最大数，确定要排序几趟
         int max = 0;
         for (int i = 0; i < array.length; i++) {
             if(max//判断位数
         int times = 0;
         while(max>0){
             max = max/10;
             times++;
         }
         //建立十个队列
         List queue = new ArrayList();
         for (int i = 0; i < 10; i++) {
             ArrayList queue1 = new ArrayList();
             queue.add(queue1);
         }
         //进行times次分配和收集
         for (int i = 0; i < times; i++) {
             //分配
             for (int j = 0; j < array.length; j++) {
                 int x = array[j]%(int)Math.pow(10, i+1)/(int)Math.pow(10, i);
                 ArrayList queue2 = queue.get(x);
                 queue2.add(array[j]);
                 queue.set(x,queue2);
             }
             //收集
             int count = 0;
             for (int j = 0; j < 10; j++) {
                 while(queue.get(j).size()>0){
                     ArrayList queue3 = queue.get(j);
                     array[count] = queue3.get(0);
                     queue3.remove(0);
                     count++;
                 }
             }
         }
     }
          public static void main(String[] args) {
              int[] a={49,38,65,97,176,213,227,49,78,34,12,164,11,18,1};
              System.out.println("排序之前：");
             for (int i = 0; i < a.length; i++) {
                 System.out.print(a[i]+" ");
             }

             sort(a);
             System.out.println();
             System.out.println("排序之后：");
             for (int i = 0; i < a.length; i++) {
                System.out.print(a[i]+" ");
             }
         }

}