Advantages of Internet:
1. Easy and fast access to information2. Up to date news information3. Communications made over internet connecting people around the world4. Convenience in doing like research where you can now do it at home instead of visiting libraries.
Disadvantages of Internet:
1. Possible theft of personal information2. Internet addiction which leads to social isolation3. Inappropriate Contents
First addition, then division
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).
Answer:
The code is witten in Java and given in the explanation section.
Using a Scanner object we receive a the user's input and with the System.out.println we output the variable
Explanation:
import java.util.Scanner;
public class VariableOutput{
public static void main (String [] args){
Scanner input = new Scanner(System.in);
System.out.println("Enter an Integer 15 or 40");
int numObjects = input.nextInt();
System.out.println("You entered the number "+numObjects);
}
}
