Builds a weak heap, a relaxed binary tree where each node only needs to dominate its right subtree, tracked with one reverse-bit per node, then merges sub-heaps to extract elements in sorted order.
Every merge of two weak heaps costs exactly one comparison, reducing total comparisons for n extractions to the theoretical minimum of n⌈log₂ n⌉, closer to the information-theoretic bound than any standard heap variant.