摘要
本文提出了一类特殊问题的排序算法。其特点是在内排序中关键字与数组下标作映射或链接处理,不实施反复比较与交换关键字的操作,时间复杂性达到O(N);在外排序中,文件输入/输出次数减少,提高了效率.这类算法适宜今后在相关大规模信息处理中广泛应用.
Some sorting algorithms are presented for a kind of special problem of which keywords in internal sort, are mapped to array element subsript or are dealt with as link. No comparsion and exchange of keywords is done, with time complexity being O(N): In external sort, there are only two file I/O records and the efficiency is enhanced. These algorithms arc to be used widely in large-scale information processing
出处
《计算机工程》
CAS
CSCD
北大核心
1992年第1期58-62,共5页
Computer Engineering
基金
国家民委科研基金资助课题
