摘要
在映射式K路合并排序算法的基础上提出了一种二次映射式K路合并排序算法，解决了当记录总数较少、关键字最大值较大时，映射式K路合并排序算法存在的存储开销浪费大的问题，并保持时间复杂性不变．
The secondary mapping Sort Algorithm for K -ways Merge is advanced on the basis of the Sort Algorithm for K - ways Merge. It can solve the problems that the primary algorithm needs a lot of extra storage,when the value of the keyword is much larger than the number of the records.
出处
《广西大学学报（自然科学版）》
CAS
CSCD
1997年第4期295-297,共3页
Journal of Guangxi University（Natural Science Edition）
