+1 vote
in Data Structures & Algorithms I by (88.2k points)
What is the run time efficiency of delete-min operation?

(a) O(log N)

(b) O(logd N)

(c) O(d logd N)

(d) O(d)

Origin of the question is Heap in section Heap of Data Structures & Algorithms I

I have been asked this question in an online interview.

1 Answer

+1 vote
by (672k points)
selected by
 
Best answer
The correct answer is (c) O(d logd N)

Explanation: The run time efficiency of a delete-min algorithm using d-1 comparisons is mathematically found to be O(d logd N).

Related questions

Welcome to TalkJarvis QnA, a question-answer community website for the people by the people. On TalkJarvis QnA you can ask your doubts, curiosity, questions and whatever going in your mind either related to studies or others. Experts and people from different fields will answer.

Categories

...