最佳基数排序

The Best Radix Sorting

摘要: 基数排序由于其效率高而被广泛应用。通常,基数排序所用的基数是10,然而.如果求得一个基数rbest,并且用rbest 为基数进行基数排序使排序时间达到最小,则这将具有非常重要的意义。本文给出了求rbest 的方法,分析了以rbest 为基数进行基数排序的时间复杂度,提出了进一步提高效率的措施,并将以rbest 为基数的基数排序速度与以10为基数的基数排序进行了比较。

Abstract: Radix sorting is widely used for its high efficiency.Generally,the radix used for radix sorting is 10.However,it is very significant to find a radix r_best that makes sorting time minimum.In this paper,we give a method to find r_best,analyse the complexity of the radix sorting which uses r_best as radix,present a way to improve the efficiency,and compare the speed of the radix sorting which uses r_best as radix with that of the radix sorting which uses 10 as radix.