2 mm: A new technique for sorting data

In computation, sorting is highly essential to access and manipulate data efficiently. Highperformance sorting algorithms have always been in demand so that computers may process data more quickly. Since the computer has become a vital tool in various domains of human life, the various researchers have investigated and presented numerous sorting algorithms to sort elements of list with minimal execution time and least space. As the volume of data increases, the urgency for efficient data processing algorithms also increases. In this novel work, we present a comparison-based sorting algorithm titled "2 mm" which is a modification of the sorting algorithm Min-Max Bidirectional Parallel Selection Sort (MMBPSS). The proposed algorithm follows divide and conquers method and uses constant space complexity i.e. O(n). Although 2 mm sort differs slightly from MMBPSS sort, its computational cost is very low and it reduces more than 50% comparison cost hence presents a more efficient solution to the sorting problems in the modern era. For performance evaluation and comparison, extensive experimentation has been performed that shows the better performance of the proposed method. (C) 2022 Elsevier B.V. All rights reserved.