Abstract
We provide a sorting algorithm, Adaptive Heapsort, that optimally adapts to several known, and new, measures of presortedness. The algorithm is motivated by a new measure, called Osc, which intuitively tells the oscillation within the input sequence. We show that Osc generalizes a number of measures appearing in the literature. Moreover, it has an interesting application in the sweepline technique in computational geometry.
Sign-in/Register to access full text options 
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.
