ABSTRACT
For a long time, sorting has been one of the most important tasks in the field of computation. Along the way, many researchers, mathematicians, and computer scientists have tried to come up with new and efficient sorting algorithms for improving the space and time complexity of primitive ones. This paper presents a sorting algorithm that performs better than existing algorithms in its best-case scenario. The time complexity of the proposed algorithm in terms of asymptotic notation is O (max (k, n)), where k denotes the highest element in the list to be sorted and n denotes the number of input elements to be sorted.
