The Merging Sort Algorithm by Linking

This paper presents a new sorting method, the new merging sort algorithm by mapping, which consists of mapping, linking and merging. Its algorithm description, time complexity and experimental results in C are given. It's proved by algorithm analysis and experimental results that its time complexity is O(N) and it has nothing to do with data distribution. The method is obviously better than that of Flash Sort、Proportion Split Sort、2-Course Merging Sort and Straight K-Course Merging Sort etc. in dealing with the large-scale gather sorting problem.