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.

I. Introduction

When given a list of elements in a random order, we want to rearrange them in ascending or descending order to perform useful operations. The sorting techniques can be divided into two categories, comparison based techniques and non-comparison based techniques. Comparison based sorting techniques include bubble sort, insertion sort, selection sort, merge sort, quick sort, etc. [1]. Non-comparison based sorting techniques include bucket sort, radix sort, etc. [2]. The current sorting techniques have certain disadvantages [3]. Sorting algorithms such as bubble sort, selection sort and insertion sort have quadratic time complexities for worst and average cases. Merge sort is faster, but it is not an in-place sort and hence requires a lot of memory. Quick sort has worst case time complexity of O(n²) for a poor pivot selection or when it tries to sort an already sorted list [4].