The Rapid Sort

HEISNAM, ROHEN SINGH and MRIGANKA, SARMAH (2014) The Rapid Sort. In: International Conference on Advances In Engineering And Technology - ICAET 2014, 24 - 25 May, 2014, RIT, Roorkee, India.

[img]
Preview
Text
20140726_111741.pdf - Published Version

Download (669kB) | Preview
Official URL: https://www.seekdl.org/conferences/paper/details/3...

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 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).

Item Type: Conference or Workshop Item (Paper)
Uncontrolled Keywords: Sorting, complexity, worst case, reverse order.
Depositing User: Mr. John Steve
Date Deposited: 27 May 2019 04:41
Last Modified: 27 May 2019 04:41
URI: http://publications.theired.org/id/eprint/2710

Actions (login required)

View Item View Item