What is the run time efficiency of delete-min operation?

Category: QuestionsWhat is the run time efficiency of delete-min operation?
Editor">Editor Staff asked 5 months ago

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.

Editor">Editor Staff answered 5 months ago

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

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: 40701