A New Optimized Version of Merge Sort

Abstract

The ordering of items of an array/list in a certain sequence is one of the crucial topics in computer science. Sorting algorithms determines the new order of elements in a data structure typically in arrays and lists, they do so based on a comparison operator. The effectiveness of these sorting algorithms is determined by calculating their time and space complexity. Financial institutions and commercial enterprises organize much of the information by sorting. They must deal with a large amount of data. There might be millions of data rows. Now we have enough space but less time that is also one the major reasons of microservices architecture is being used nowadays. The microservice design enables the fast, frequent, and reliable delivery of large, sophisticated applications. Hence, the algorithms must be lightning fast. The purpose of this study is to improve on the classic Merge Sort Algorithm and create a new approach with a faster execution time. Merge sort is a popular method for sorting large datasets since it is typically efficient and straightforward to implement. The proposed method surpasses the standard Merge Sort algorithm, which has a time complexity of O(nlog <inf xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</inf> n). The proposed approach has been examined, executed, and compared, with favourable findings and the suggested modified mergesort algorithm is 12.12% faster than the usual merge sort.