heapify in a sentence

1. The heapify procedure can be thought of as building a heap from the bottom up by successively sifting downward to establish the heap property.
2. Heaps lead to an solution to online partial sorting : first " heapify ", in linear time, the complete input array to produce a min-heap.
3. For the above algorithm to correctly re-heapify the array, the node at index " i " and its two direct children must violate the heap property.
4. Thus, when the siftDown heapify begins and is calling siftDown on the bottom and most numerous node-layers, each sifting call will incur, at most, a number of swaps equal to the " height " ( from the bottom of the heap ) of the node on which the sifting call is made.
5. It's difficult to find heapify in a sentence.