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:
Explanation:
The following code is written in Java and it asks you for your age and then prints out the exact date from your birthday that you will turn 10,000 days old.
import java.util.Calendar;
import java.util.Date;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
System.out.println("What is your age?");
int age = in.nextInt();
int daysLeft = (10000 - (age*365));
Date birthday = new Date();
Calendar cal = Calendar.getInstance();
cal.setTime(birthday);
cal.add(Calendar.DATE, daysLeft);
Date modifiedDate = cal.getTime();
System.out.println(modifiedDate);
}
}
C vraiment très facile
Si tu a besoin d’aide recontacter moi
Answer: I dont really know but im guessing it depends on the type of assignment you have. im thinking True.
Explanation: