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

(a) O(N)

(b) O(log N)

(c) O(logd N)

(d) O(N^d)

The query is from Heap topic in portion Heap of Data Structures & Algorithms I

This question was posed to me by my college director while I was bunking the class.

1 Answer

+1 vote
by (672k points)
selected by
 
Best answer
Right option is (c) O(logd N)

Easy explanation - The run time efficiency of an insertion algorithm in a d-heap is found to be O(logd N) where d is the number of children.

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

...