i have seen 3 times the whole video but didn’t get what are we substituting and why we are substituting
Iam not getting any thing
Hey @pankajsingh
The simple way to explain this will be
Heap sort works in NlogN time where N is number of elements.
We need to know what is X ( number of elements ) such that XlogX = logn.
We have 2 options to check X1, X2.
Substitute X1 in NlogN and X2 in NlogN.
See which equals to logn.
That’s all.
If your doubt is resolved please mark it as closed.
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.