OneByOne (OBO): A Fast Sorting Algorithm
Ashjan Alotaibi, Alhanouf Almutairi, Heba A. Kurdi · Procedia Computer Science · 2020
Many sorting algorithms have been developed to enhance the performance of important applications from different domains such as commercial commuting, operational research and scientific simulation. In this paper, we propose a new in-place sorting algorithm called OneByOne (OBO) sort. When compared to selection sort and bubble sort algorithms, OBO demonstrated faster run time at different array sizes. OBO also showed nearly equal performance when compared to the insertion sort algorithm.