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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
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 call
