Abstract
A new measure of presortedness is presented which we call Par . We prove that it is distinct from other common measures of presortedness and we design sorting algorithms that sort a sequence X in O (| X | log Par ( X )) comparisons. Moreover, we prove that this is Par -optimal in a comparison-based model of computation.
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.
