地址基数排序算法的设计与实现  

DESIGN & IMPLEMENTATION OF AN ADDRESS-RADIX-SORTING ALGORITHM

作　　者：王岁花[1] 安秋生[2] 

机构地区：[1]河南师范大学计算机科学系,河南新乡453002 [2]山西师范大学数学与计算机学院,山西临汾041004

出　　处：《计算机应用与软件》2005年第11期99-101,共3页Computer Applications and Software

摘　　要：本文提出了一种集地址排序与基数排序优点于一体的具有比传统快速排序算法性能更高的排序方法,全文给出了该算法的描述、部分源程序、时间/空间复杂度分析。本算法由于具有不需要关键字比较的特点而特别适用于大数据量的排序,又由于有不需要移动元素的特点而特别适用于大记录的排序工作,应用结果表明,该算法具有很高的实用价值。In this paper,a address-radix-sorting algorithm which is higher in performance than traditional ones has been established. The algorithm needs neither the keyword comparisons nor record movements. Its description, partial source program, time and space complexity are presented. In addition, the experiments show 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.

关 键 词：地址基数排序算法 复杂度 数据排序 桶排序 存储空间分配 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]