Weak heaps may be used to sort an array, in essentially the same way as a conventional heapsort [REF].
Sifting down in a weak heap can be done in h = comparisons, as opposed to 2 log2n for a binary heap, or 1,5 log2n for the "bottom-up heapsort" variant.