Abstract
We present a more efficient CREW PRAM algorithm for integer sorting. This algorithm sorts n integers in { 0, 1, 2, ..., n 1/2} in O((logn)3/2/loglogn) time and O(n (logn/loglogn)1/2) operations. It also sorts n integers in {0, 1, 2,..., n − 1} in O((logn)3/2/loglogn) time and O(n (logn/loglogn)1/2logloglogn) operations. Previous best algorithm [13] on both cases has time complexity O(logn) but operation complexity O(n(logn)1/2).
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.
