Super Sort Sorting Algorithm

Sorting algorithms are a major area of research in computer science and engineering where the simple task of sorting the numbers leads to complex algorithms. In recent years, many researchers have proposed several sorting techniques to enhance time and space complexities of the algorithms. The sorting technique presented in this paper makes use of the natural sequence of sorted elements in an array of random numbers so as to reduce the number of steps needed to sort. The complexity of the proposed algorithm is O(nlogn) where n represents the number of elements in the input array.