sift-down
RU: просеивание вниз (sift-down)
A heap operation that restores the heap property after the root is replaced: the misplaced element is repeatedly compared with its children and swapped with the smaller one (in a min-heap) until the order is correct or a leaf is reached. Costs O(log n).