International Journal of Advances in Computer Science and Its Applications
Author(s) : MRIGANKA SARMAH , HEISNAM ROHEN SINGH
Sorting is arranging a collection of elements either in ascending or descending order. There are various applications of sorting algorithm in every field of science. Already there exist different sorting algorithms with different complexities. In worst case, the best known complexity is O(n log n). In this, a sorting algorithm is developed and compared with the existing sorting algorithm. It is found the new algorithm is much better than the existing sorting algorithm like the Quick Sort, Merge sort etc. This algorithm is much better for closely related datasets. To sort the element in reverse order it can accomplished the sorting in O(n).