Answer:
PDF
Explanation:
Just did the assignment egde 2021
In the case above, the operation is not efficiently supported by heaps is Find.
<h3>What are heap operations?</h3>
The operation that are known to often use heaps are:
- Heapify
- Find-max (or Find-min)
- Insertion, etc.
Therefore, In the case above, the operation is not efficiently supported by heaps is Find.
See full question below
Which operation is not efficiently supported by heaps?
a. DeleteMin
b. Find
c. FindMin
d. Insert
e. all of the above are sufficiently supported
Learn more about operation from
brainly.com/question/24214198
#SPJ11
Answer:
public class Pyramid {
public static void main(String[] args) {
int h = 7;
System.out.println("Pattern A");
for(int i = 1; i <= h; ++i)
{
for(int j = 1; j <= i; ++j) {
System.out.print("+");
}
System.out.println();
}
System.out.println();
System.out.println("Pattern B");
for (int i = 1; i<=h; ++i)
{
for(int j = h; j >=i; --j){
System.out.print("+");
}
System.out.println();
}
}
}
Explanation:
- The trick in this code is using a nested for loop
- The outer for loop runs from i = 0 to the heigth of the triangle (in this case 7)
- The inner for loop which prints the (+) sign runs from j = 0 to j<=i
- It prints the + using the print() function and not println()
- In the pattern B the loop is reversed to start from i = height
