基于基数的一种快速排序算法

A quicksort Algorithm base on Radix

给出了一种基于基数的具有比传统快速排序算法性能更高的排序方法,全文给出了该算法的描述,时间/空间复杂度分析.本算法由于具有不需要关键字比较的特点而特别适用于大数据量的排序,又由于有不需要移动元素的特点而特别适用于大记录的排序工作,应用结果表明,该算法具有很高的实用价值.

In this paper, a quick sorting Algorithm which is higher in performance than traditional ones has been established. The Algorithm needs neither the comparisons nor record movements. Its description ,time and space complexity are presented. In addition, the experiments say it is particularly suitable to the sorting operation of a great quantity of data and records. The application result says it is effective and worth using