基数排序

package L4;

import java.util.Arrays;
import java.util.LinkedList;

public class L1 {

	// 基数排序
	public static void main(String[] args) {
		// TODO Auto-generated method stub

		int[] arr = { 12, 34, 66,53, 45, 65, 56 };
		LinkedList<Integer>[] buc = new LinkedList[10];
		for (int i = 0; i < 10; i++) {
			buc[i] = new LinkedList<>();
		}
		int length = arr.length;
		for (int i = 0; i < length; i++) {
			int t = arr[i] % 10;
			buc[t].add(arr[i]);
		}
		int k=0;
		for (int i = 0; i <10; i++) {
			while(!buc[i].isEmpty())
				arr[k++]=buc[i].poll();
		}
		System.out.println(Arrays.toString(arr));
		for (int i = 0; i < length; i++) {
			int t=arr[i]/10;
			buc[t].add(arr[i]);
		}
		k=0;
		for (int i = 0; i < 10; i++) {
			while(!buc[i].isEmpty())
				arr[k++]=buc[i].poll();
		}
		System.out.println(Arrays.toString(arr));
	}

}