Enhanced Merge Sort- A New Approach to the Merging Process

Abstract

One of the major fundamental issues of Computer Science is arrangement of elements in the database. The efficiency of the sorting algorithms is to optimize the importance of other sorting algorithms11. The optimality of these sorting algorithms is judged while calculating their time and space complexities12. The idea behind this paper is to modify the conventional Merge Sort Algorithm and to present a new method with reduced execution time. The newly proposed algorithm is faster than the conventional Merge Sort algorithm having a time complexity of O(n log2 n). The proposed algorithm has been tested, implemented, compared and the experimental results are promising.