Automatic organization of a set in a heap

The organization of a set in the form of a heap is the basis for the construction of binary search trees. The algorithm for organizing a set in the form of a pile is laborious and requires a high volume of resources. In this paper we have automated the algorithm for organizing a set in the form of a heap. We developed a program in the C++ programming language that implements the heap generation algorithm and I analyzed a numerical example.