基数排序(radix sort）则是属于“分配式排序”（distribution sort），基数排序法又称“桶子法”（bucket sort）或bin sort，顾名思义，它是透过键值的部份资讯，将要排序的元素分配至某些“桶”中，藉以达到排序的作用，基数排序法是属于稳定性的排序，其时间复杂度为O (nlog(r)m)，其中r为所采取的基数，而m为堆数，在某些时候，基数排序法的效率高于其它的比较性排序法。

-Radix sort (radix sort) is a " distributive sort"　(distribution sort), radix sorting method known as " bucket method"　(bucket sort) or bin sort, the name suggests, it is a key part of the information through, elements to be assigned to some sort of " bucket"　in order to achieve the sort of role in the stability of radix sort is the sorting method is its time complexity is O (nlog (r) m), where r is the base taken , and m is the number of reactors, at some point, radix sorting method is more efficient than other comparable sort.