Abstract
We consider the problem of sorting an input of size n2 with keys restricted to the set {0, 1} on an n × n mesh-connected computer. We present a deterministic algorithm that sorts to an arbitrary indexing scheme, using constant size queues, requiring 2.5n + o(n) steps. This is a significant improvement over the best previous algorithm for this problem which runs in 4n + o(n) steps [7], The problem has applications in divide-and-conquer algorithms and to "packing" problems.
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.
