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

› Category: Questions › The Statement “Fibonacci heap has better amortized running time in compare to a binomial heap”.
0 Vote Up Vote Down
Editor">Editor Staff asked 5 months 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.

Question Tags:
1 Answers
0 Vote Up Vote Down
Editor">Editor Staff answered 5 months 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).


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

Related Posts