Time complexity analysis of nlogn ,array to heap

#1

hey cannot the how the time complexity was calculating using a.p,g.p can u explain

#2

Hello @sheikhhaji18 it is simple that heapify takes O(logn) time and there are n nodes then the overall time complexity is O(nlogn).

#3

hi we are not doing heapify here?

#4

ohh yes i took it as wrong.
time complexity of building a heap from an array is O(n) .
you can see the proof from here:
https://www.quora.com/How-is-the-time-complexity-of-building-a-heap-is-o-n
if you dont understand anything you can ask here:
Happy Learning!!

#5

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.