Systematic review and exploration of new avenues for sorting algorithm

Abstract

Sorting plays a crucial role in almost all algorithms that support data science applications. A quadratic sorting algorithm is one in which the time taken for the algorithm to sort a dataset grows as the square of the size of the dataset. This paper aims at developing a new quadratic sorting algorithm by addressing the limitations in existing sorting algorithms. We use the idea that an unsorted data sequence can be thought of as a set of disjoint sorted sequences of data items. This paper describes a novel approach to provide a solution towards an unsorted sequence of data items. We have compared our method with existing quadratic sorting algorithms to demonstrate its efficiency over other techniques.