A new modified sorting algorithm: A comparison with state of the art

Choosing the right method to sort numbers has a huge effect on how quickly a computer can process a task. The most used sorting algorithms today have been discovered years ago, and to this day, they have been the best for the job as there was no other competitive algorithm. Through this paper, we make an analysis and comparison between the state of the art algorithms in sorting and based on their analogy of functionality, we propose a new modified sorting algorithm. We then present a brief description of the new modified algorithm, conduct comparisons with the state of the art, and finally we give conclusions about the performance of the proposed algorithm versus the most popular sorting algorithms. Moreover, we highlight the benefits of using this algorithm in different fields by various business companies or software developers, in cases when they need faster and easier sorting for their data management.