Avi sort algorithm

In the case of rearranging an array with N elements either in ascending or in descending order. We find that, sorting algorithms such as the Bubble, Insertion and Selection Sort have a quadratic time complexity. In this paper, we introduce Avi sort - a new algorithm to sort an N elements array by exchanging their specific alternate position. We evaluate time complexity O(N2) of Avi sort theoretically and empirically. Our results show a one more different way to sort the data elements in quadratic time complexity and experimentally prove its actual time lies in between insertion and selection sort.