What is the worst case time in searching minimum value in weak -heap?

› Category: Questions › What is the worst case time in searching minimum value in weak -heap?
0 Vote Up Vote Down
Editor">Editor Staff asked 5 months ago

What is the worst case time in searching minimum value in weak -heap?
 
(a) O(log n)
 
(b) O(n)
 
(c) O(n logn)
 
(d) O(1)
 
This intriguing question comes from Weak Heap topic in portion Heap of Data Structures & Algorithms I
 
The question was posed to me in examination.

Question Tags:
1 Answers
0 Vote Up Vote Down
Editor">Editor Staff answered 5 months ago

The correct choice is (d) O(1)
 
Easy explanation – Weak heap is an array based form that supports the operation of finding a minimum in O(1).


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

Related Posts