Open AccessAutomatic organization of a set in a heap
Author(s) -
Paul Vasiliu
Publication year - 2021
Publication title -
scientific bulletin
Language(s) - English
Resource type - Journals
eISSN - 2392-8956
pISSN - 1454-864X
DOI - 10.21279/1454-864x-21-i1-014
Subject(s) - heap (data structure) , computer science , set (abstract data type) , theoretical computer science , programming language
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.