build-heap
RU: построение кучи (build-heap)
The procedure that turns an unordered array into a heap by sifting down every non-leaf node, from the last one back to the root. It runs in O(n), faster than the O(n log n) of pushing n elements one by one.