English

应用科学学报 ›› 1991, Vol. 9 ›› Issue (4): 354-358.

• 论文 • 上一篇    下一篇

一个分布型排序算法研究——子域映射法

杨宪泽   

  1. 西南民族学院
  • 收稿日期:1989-10-20 修回日期:1990-07-26 出版日期:1991-12-31 发布日期:1991-12-31
  • 基金资助:
    国家民委科研基金资助课题

SUBFIELD MAP METHOD——AN ALGORITHMRESEARCH FOR DISTRIBUTIVE SORT

YANG XIANZE   

  1. Southwest Nationalities Gollege
  • Received:1989-10-20 Revised:1990-07-26 Online:1991-12-31 Published:1991-12-31

PDF

75

被引次数

13

摘要： 提出了一个新的排序算法——子域映射快速排序法.该算法亦属分布型排序算法,在文献[5]基础上修改.这一算法考虑了关键字的分布,不实施反复比较和交换两种操作,而解决关键字长、数据分布不均带来的问题.理论分析和实验结果表明,该算法效率高,通常情况下优于Hoare快速排序法,适宜大型信息排序.

关键词: 子域映射, 排序速度, 分布型, 附加存贮开销, 排序

Abstract: 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.

Key words: memory overhead, subfield map, sort, distributive type, sort speed