Merging sort by mapping

This paper presents a new sorting method, the merging sort algorithm by mapping, which consists of mapping, linking and merging. The algorithm description, the time complexity and the experimental results in C language are also given in this paper. The algorithm analysis and experimental results show that the time complexity is O(N), which is not related to the distribution of the data. The method is obviously better than Flash Short, Proportion Split Sort, 2-Course Merging Sort and Straint K-Course Merging Sort in dealing with the sorting problem of large datasets.