+1 vote
in Data Structures & Algorithms I by (88.2k points)
What is the run time efficiency of an insertion algorithm?

(a) O(N)

(b) O(log N)

(c) O(N^2)

(d) O(M log N)

My doubt stems from Heap topic in section Heap of Data Structures & Algorithms I

This question was addressed to me in my homework.

1 Answer

+1 vote
by (672k points)
selected by
Best answer
The correct option is (a) O(N)

Best explanation: The run time efficiency of an insertion algorithm in a pairing heap is mathematically found to be O(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.