Abstract
Schnorr and Shamir and independently Kunde, have shown that sorting N=n/sup 2/ inputs into snake-like ordering on a n*n mesh requires 3n-o(n) steps. Using a less restrictive, more realistic model the author shows that the sorting N=n/sup 2/ integers in the range (1. . .N) can be performed in 2n+o(n) steps on a n*n mesh. >
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.
