Algorithm

Question

Deleting any random element in heap would take n+logn or n+n?

Comments

Is it not multiplying requires @Shaik?

because we need both first finding and then heapify operation

It is not an OR operation right?

 

---

No, addition is required not multiplication. U search an element in O(n) and then heapify it O(logn). Nlogn means u r repeating heapify function N times.

---

 @srestha mam

because we need both first finding and then heapify operation

yes, in normal language, but in Algorithms

first loop finds ===>O(n)

second heapify ===> O(log n) 

 

mam, nephron explained it very well

Answer 1

The deletion of random element takes 0(n) + 0(logn) time.

0(n) as the array traverses to find the last element and assign it to the root;

0(logn) as the element swaps as per max/min heap condition and deletion takes for the root.