New Sorting Algorithm—RevWay Sort

Sorting provides a method of rearrangement of elements in ascending or descending order. In this paper, we are introducing a new sorting algorithm called RevWay sort in which the two consecutive numbers are compared from left and then from right. This process is repeated \(((n/2)+1)\) times, where n is the total number of elements. We have compared running time of the proposed algorithm with other sorting algorithms. We run the algorithm starting from 10,000 to 50,000 elements. We found that the newly proposed RevWay sort yields lesser running time compared to bubble and selection sort. For 10,000 elements, RevWay sort takes 203.636 ms, whereas bubble sort takes 364.8243ms and selection sort consumes 337.5543 ms.