摘要
提出了一类问题的映射排序算法。其特点是附加一定的存储开销，在内排序中关键字与数组下标作映射或链接处理，不实施反复比较与交换关键字的操作，时间复杂性达到Ｏ（Ｎ）；在外排序中，文件输入／输出次数减少，提高了效率，这类算法适宜今后在大规模信息处理中广泛采用。
Some map sort algorithms are presented for a kind of problem with a memory cost ,of which
出处
《西南民族学院学报（自然科学版）》
1995年第4期384-390,共7页
Journal of Southwest Nationalities College(Natural Science Edition)
关键词
排序
映射
信息处理
算法
in internal sort are mapped to array element subscript or are dealt with as link. No comparison and exchange ofKeywords is done, with time complexity being O(N). In external sort, there are only two file I/O records and the efficiency is enhanced. The alg
