+1 vote
in Data Structures & Algorithms I by (88.2k points)
Out of the following given options, which is the fastest algorithm?

(a) fibonacci heap

(b) pairing heap

(c) d-ary heap

(d) binary heap

My enquiry is from Heap in section Heap of Data Structures & Algorithms I

This question was posed to me in a job interview.

1 Answer

+1 vote
by (672k points)
selected by
Best answer
Correct option is (a) fibonacci heap

The best I can explain: Although pairing heap is an efficient algorithm, it is worse than the Fibonacci heap. Also, pairing heap is faster than d-ary heap and binary heap.

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.