###
DOI:
Journal of Software:1993.4(2):48-52

长记录位置不变的排序算法
杨宪泽
(西南民族学院 成都 610041)
THE SORT ALGORITHM OF UNCHANGEABLE LONG-RECORDS PLACE
Yang Xianze
()
Abstract
Chart / table
Reference
Similar Articles
Article :Browse 2840   Download 2814
Received:September 25, 1990    Revised:February 01, 1991
> 中文摘要: 现有的排序算法,长记录位置不变算法时间复杂性还是O(N2),不能满足大规模信息处理需要。本文在文献[1,2]基础上,提出了一个提高排序速度的新算法,这一算法关键字与数组下标作映射处理,不实施反复比较和交换关键字的操作,时间复杂性达到O(N),适宜今后在大规模信息处理中广泛应用。
中文关键词:
Abstract:Over the years many sort algorithms have been produced, and the time complexity of unchangeable long-records place algorithms still is O(N2). It can t satisfy needs of large-scale information treatment. On the basis of Refs. [1,2], the new algorithm is mentioned in this note to enhance the sort speed. In this algorithm, the keywords is mapped to array element subscript and we don t carry out two operations of comparision and exchanges of keywords. Its time complexity is O(N), and the algorithm is appropriate to widely used large-scale information treatment in the future.
keywords:
文章编号:     中图分类号:    文献标志码:
基金项目:国家民委科研基金资助 国家民委科研基金资助
Foundation items:
Reference text:

杨宪泽.长记录位置不变的排序算法.软件学报,1993,4(2):48-52

Yang Xianze.THE SORT ALGORITHM OF UNCHANGEABLE LONG-RECORDS PLACE.Journal of Software,1993,4(2):48-52