Answer:
D
Explanation:
snowflakes cant dance.Its a human things.
A musical timer is a metronome.
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: Maybe try to move router.
Explanation:
Answer:
b. 2.9!
Explanation:
There are is a mistake in the question.
Suppose the group consist of 10 kids and 2 adults, the number of ways in which they can form the line is:
= 2! 10!
= 2× 1× 10!
= 2.10!
But since that is not in the given option.
Let assume that the group consists of 9 kids and 2 adults, the number of ways in which they can form the line is:
No of ways the kids can be permutated = 9 ways
No of ways the adult can be permutated = two ways.
Thus; the number of ways in which they can form the line = 2! 9!
= 2 × 1× 9!
= 2.9!