What is the run time efficiency of an insertion algorithm?

Category: QuestionsWhat is the run time efficiency of an insertion algorithm?
Editor">Editor Staff asked 1 month ago

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 Answers
Editor">Editor Staff answered 1 month ago

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).