Abstract
Given a setA and a total ordering relation defined on its elements, we consider a partial reconstruction of the ordering. IfS is the totally ordered sequence of the elements ofA, andk is positive integer, the problem ofquasi sorting is introduced as the one of generating ak-sorted sequenceP, where the position of each elementp inP is at a distance bounded byk from the position ofp inS. We present some properties ofk-sorted sequences, and pose the bases for the development of algorithms for generatingk-sorted sequences through element comparisons.
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.
