Index Sort Algorithm For Positive Integers
Various methods for sorting integer numbers have been devised ranging from bubble sort, merge sort, insertion and their likes. The complexities, f(n) of these sorting algorithms do not make their implementation easy. In this paper, we propose a new sorting algorithm that accepts numbers to be sorted; declare an array for these elements, store these numbers as index of the array and copy them out from the array the way they have been stored. This has shown that integer numbers have naturally been sorted in their order of magnitude and that the running time for this algorithm is linear, that is O(n). This makes it naturally better than most known sorting schemes.