THE SORT ALGORITHM OF UNCHANGEABLE LONG-RECORDS PLACE
Affiliation:

  • Article
  • | |
  • Metrics
  • |
  • Reference [6]
  • |
  • Related
  • |
  • Cited by [6]
  • | |
  • Comments
    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.

    Reference
    [1] 杨宪泽,分级快速排序法研究,科学通报,34:11(1989),871—873.
    [2] 杨宪泽,子域映射快速排序法研究,科学通报,35:15(1990),1199—1200.
    [3] 王本颜,方蕴昌,数据结构技术,清华大学出版社,1988.
    [4] Mc CuIIoch.C.M,Quickshunt-A Distributive Sorting Algorithm,Computer Journal 25:1(1982),102-1()4.
    [5] Barstow D.R,Remarks on A Syntheis of Serveral Sorting Algorithms,Actu Information 13:3(1980),225—227·
    [6] 张怀莲,宏汇编语言程序设计,电子工业出版社,1989.
    Related
    Comments
    Comments
    分享到微博
    Submit
Get Citation

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

Copy
Share
Article Metrics
  • Abstract:3899
  • PDF: 4824
  • HTML: 0
  • Cited by: 0
History
  • Received:September 25,1990
  • Revised:February 01,1991
You are the first2038768Visitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address:4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code:100190
Phone:010-62562563 Fax:010-62562533 Email:jos@iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063