本程序实现了对六个1000以内的正整数的基数排序。排序过程分为三个阶段，第一个阶段是比较个位，第二个是比较十位，第三个阶段是比较百位由三个函数实现。-This program of six positive integer less than 1000 base sort. Sorting process is divided into three phases, the first stage is to compare a bit, the second is more 10, the third stage is the comparison of three 100 function.