Array-indexed sorting algorithm for natural numbers

In this paper we present a sorting algorithm for natural numbers, which uses the methodology of indexing of the array and insert that number into proper index of the array without performing any element comparisons and swapping. This algorithm efficiently to give a much better performance than the existing sorting algorithms of the O(n2) class, for large array size with same length of digits of input data.