The Statement “Fibonacci heap has better amortized running time in compare to a binomial heap”.

Category: QuestionsThe Statement “Fibonacci heap has better amortized running time in compare to a binomial heap”.
Editor">Editor Staff asked 4 weeks ago

The Statement “Fibonacci heap has better amortized running time in compare to a binomial heap”.
 
(a) True
 
(b) False
 
My doubt stems from Binomial and Fibonacci Heap in chapter Heap of Data Structures & Algorithms I
 
I got this question in final exam.

1 Answers
Editor">Editor Staff answered 4 weeks ago

Correct choice is (a) True
 
Best explanation: Overall complexity of insertion, merging, deleting is in order of O((a+b)logn) For Fibonacci the complexity reduces to O(a+ blogn).