Abstract
Sorting algorithms are a major area of research in computer science and engineering where the simple task of sorting the numbers leads to complex algorithms. In recent years, many researchers have proposed several sorting techniques to enhance time and space complexities of the algorithms. The sorting technique presented in this paper makes use of the natural sequence of sorted elements in an array of random numbers so as to reduce the number of steps needed to sort. The complexity of the proposed algorithm is O(nlogn) where $n$ represents the number of elements in the input array.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
