-
-
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 rbest that makes sorting time minimum.In this paper,we give a method to find rbest,analyse the complexity of the radix sorting which uses rbest as radix,present a way to improve the efficiency,and compare the speed of the radix sorting which uses rbest as radix with that of the radix sorting which uses 10 as radix.
-
-