摘要
提出了一个新的排序算法——子域映射快速排序法.该算法亦属分布型排序算法,在文献[5]基础上修改.这一算法考虑了关键字的分布,不实施反复比较和交换两种操作,而解决关键字长、数据分布不均带来的问题.理论分析和实验结果表明,该算法效率高,通常情况下优于Hoare快速排序法,适宜大型信息排序.
This article puts forward a new sort algorithm … the subfield map quick sort method. It makes a great amount of modification based on Ref. [5] and belongs to a distributive sort. In this algorithm, the key words; distribution is considered only, comparison and exchanges of key words being omitted. The purpose of the work is to solve the problem: why the sort method of Ref. [5] fails when the key word is long and, the data are not equally distributed. The theoretical analysis and the experimental results prove that the efficiency of the algorithm is higher than Hoare's in the ordinary case, and the algorithm is appropriate for large-scale information sort.
出处
《应用科学学报》
CAS
CSCD
1991年第4期354-358,共5页
Journal of Applied Sciences
基金
国家民委科研基金资助课题
关键词
排序
分布型
子域映射
算法
计算机
sort, distributive type, subfield map, sort speed, memory overhead.
