基数排序算法实现(Java版)

import java.util.ArrayList;

/**
 * @function:基数排序算法实现
 * */
public class RadixSort {

	// 构建一个二维数组，装载每次分配的数据
	private ArrayList[] tempList = new ArrayList[10];

	/**
	 * @function:构造方法，用于初始化RadixSort类
	 * */
	public RadixSort() {
		for (int i = 0; i < this.tempList.length; i++) {
			this.tempList[i] = new ArrayList();
		}
	}

	// 收集数据
	private String[] Collection(int length) {
		String[] a = new String[length];
		int k = 0;
		for (int i = 0; i < this.tempList.length; i++) {
			for (int j = 0; j < this.tempList[i].size(); j++) {
				a[k++] = (String) this.tempList[i].get(j);
			}
			this.tempList[i] = new ArrayList();
		}
		return a;
	}

	/**
	 * @function:分配数据
	 * @param: unsort 为需要排序的数组
	 * @param: index为需要按第几位分配
	 * */
	private void Distribution(String[] unsort, int index) {
		for (int i = 0; i < unsort.length; i++) {
			int j = Integer.parseInt(unsort[i].substring(index, index + 1));
			tempList[j].add(unsort[i]);
		}
	}

	/**
	 * @function:基数排序算法
	 * */
	public String[] radix(String[] a) {
		for (int i = 2; i >= 0; i--) {
			this.Distribution(a, i);
			a = this.Collection(a.length);
		}
		return a;
	}

	/**
	 * @function:打印数组
	 * */
	private void print(String[] a) {
		for (int i = 0; i < a.length; i++) {
			System.out.print(a[i] + " ");
		}
		System.out.println();
	}

	public static void main(String[] args) {
		RadixSort r = new RadixSort();
		String[] a = new String[] { "278", "109", "063", "930", "589", "333", "679" };
		// 打印数据
		r.print(a);
		// 基数排序
		a = r.radix(a);
		// 打印数据
		r.print(a);
	}
}