Comparing rapid sort with some existing sorting algorithms

Abstract

Sorting is arranging a collection of elements either in ascending or descending order. There are various applications of sorting algorithm in every field of computer science. Already there exist different sorting algorithms with different complexities. In worst case, the best known complexity is O (nlog n). We have an algorithm called RAPID SORT and analyzed in detail and also compared with some of the existing algorithm like the Quick Sort, Merge sort, Bubble sort, Insertion sort, and selection sort. This algorithm is much better for closely related datasets. This algorithm is very efficient to sort the elements in reverse order.