# 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 5 months 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 5 months 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).

Notice: Trying to get property 'ID' of non-object in /home/fvckxqmi/public_html/wp-content/themes/blocksy/inc/single/single-helpers.php on line 17

Notice: Trying to get property 'ID' of non-object in /home/fvckxqmi/public_html/wp-content/themes/blocksy/inc/single/single-helpers.php on line 17

Notice: Trying to get property 'ID' of non-object in /home/fvckxqmi/public_html/wp-content/themes/blocksy/inc/single/single-helpers.php on line 17

Notice: Trying to get property 'ID' of non-object in /home/fvckxqmi/public_html/wp-content/themes/blocksy/inc/single/single-helpers.php on line 17
Articles: 40702