Social worker and legal aid worker
By default the normal style inserts a vertical space equal to 1.5 size vertical lines between each line of text.
Answer:
#include <iostream>
using namespace std;
int main()
{
int i = 45;
for ( i = 45; i <=165; i = i + 6)
cout << i << endl;
}
Explanation:
I corrected your code and highlighted the mistakes. Even though you wrote the correct algorithm, your code did not compile because of the typos you made.
Remember, C++ is a case-sensitive language. That means, "For" is not same as "for".
Generally, variables and keywords are written in lower case. Of course, there are exceptions, such as constant variables are all written in uppercase letter and class names start with an uppercase letter.
Answer:
Explanation:
We start from the bottom-most and rightmost internal node of min Heap and then heapify all internal modes in the bottom-up way to build the Max heap.
To build a heap, the following algorithm is implemented for any input array.
BUILD-HEAP(A)
heapsize := size(A)
for i := floor(heapsize/2) downto 1
do HEAPIFY(A, i)
end for
Convert the given array of elements into an almost complete binary tree.
Ensure that the tree is a max heap.
Check that every non-leaf node contains a greater or equal value element than its child nodes.
If there exists any node that does not satisfy the ordering property of max heap, swap the elements.
Start checking from a non-leaf node with the highest index (bottom to top and right to left).
The GUI or Graphical <u /><u></u><em />User Interface.
