Abstract
We propose a balanced bin sort for hypercube multicomputers. This sorting algorithm has an empirically measured expected run time that is greater than that of hyperquicksort but less than that of bitonic sort. Also, its space requirements are less than that of hyperquicksort but more than that of bitonic sort. So, it is useful in situations in which there is some excess memory but not enough to run hyperquicksort.
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.
