基数排序的串行程序，基数排序法又称“桶子法”（bucket sort）或bin sort，顾名思义，它是透过键值的部份资讯，将要排序的元素分配至某些“桶”中，藉以达到排序的作用，基数排序法是属于稳定性的排序，其时间复杂度为O (nlog(r)m)，其中r为所采取的基数，而m为堆数，在某些时候，基数排序法的效率高于其它的稳定性排序法。-Radix sort of serial program, radix sorting method known as " bucket method"　(bucket sort) or bin sort, as the name suggests, it is through some of the key information, and will want to sort the elements assigned to some of the " barrel"　in , in order to achieve the sort of role, radix sort method belongs to the stability of the sort, its time complexity is O (nlog (r) m), where r is taken to the base, and m is the number of the heap, at some point, radix sort efficiency than other sort of stability.