unable to get ,it seems confusing
Logn heap sort time compexity unable to understand
insertion/deletion from heap takes logN time complexity where N is number of values in heap. This is possible as heap is a balanced binary tree and hence height is always logN.
Heapify operation is performed along depth of heap, so it doesn’t encounter elements more than max height, therefore complexity is limited to logN.
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.