Abstract
Given n elements from a totally ordered set we outline a method for choosing an element whose rank is γ n for some 0 <γ<1 where γ is independent of n. The algorithm executes in constant time in a CRCW PRAM model using a linear number of processors and succeeds with probability 1 − n − c for any c>0.
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.
