Comparator networks for constructing binary heaps of size n are presented which have size O(n log log n) and depth O(log n). A lower bound of n log log n-O(n) for the size of any heap construction network is also proven, implying that the networks presented are within a constant factor of optimal. We give a tight relation between the leading constants in the size of selection networks and in the size of heap construction networks.
CITATION STYLE
Stølting Brodal, G., & Cristina Pinotti, M. (1998). Comparator networks for binary heap construction. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1432, pp. 158–168). Springer Verlag. https://doi.org/10.1007/BFb0054364
Mendeley helps you to discover research relevant for your work.