+1 vote
in Data Structures & Algorithms I by (88.2k points)
The amortized time efficiency for performing deletion of a minimum element is?

(a) O(N)

(b) O(log N)

(c) O(N^2)

(d) O(M log N)

I need to ask this question from Heap in chapter Heap of Data Structures & Algorithms I

I have been asked this question in semester exam.

1 Answer

+1 vote
by (737k points)
selected by
 
Best answer
The correct answer is (b) O(log N)

Best explanation: The amortized time efficiency for performing deletion of a minimum element is mathematically found to be O(log 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

...