sir add 2 in T(N/2) but there we are doing comparison and swapping so we should add more than two so at last it will not 2k it will that cons time 2k
Binary heap doubt
@deepakjumani09,
In complexity analysis, the constant term in a recurrence does not matter,
So, T(n) = T(n/2) + O(c) = O(log2(n^c)) if c<<n
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.