The Index Sorting Algorithm

Abstract

Efficient sorting and searching are corner-stones in algorithm design. In computer science it has become a deep-rooted habit to use comparison-based methods to solve these problems. In this research paper we have come up with a new algorithm which we have named ‘The Index Sorting Algorithm’, that sorts given list of elements in the array in O(n) time and O(n) space complexity in worst case, better than any other sorting algorithm. The algorithm is very easy to implement and understand.