基数排序：



使用10个辅助队列，假设最大数的数字位数为 x， 则一共做 x次，从个位数开始往前，以第i位数字的大小为依据，将数据放进辅助队列，搞定之后回收。下次再以高一位开始的数字位为依据。



以Vector作辅助队列，基数排序的Java代码-Radix sort:



10 auxiliary queue, assuming the maximum number of digits for x, made ​ ​ a total of x times, from single digits begin to move forward, based on the size of the i-th digit data into the auxiliary queue, get after recovery . Next based on a start digit.



Vector auxiliary queue, Radix Sort Java code