Saturday, July 13, 2019

How to prove T(n)=Tleft(fracn4right)+Tleft(frac3n4right)+n is mathcalO(nlogn) using induction?

How would you go about proving the recursion
T(n)=T(n4)+T(3n4)+n

is O(nlogn) using induction?




Thanks!

No comments:

Post a Comment

analysis - Injection, making bijection

I have injection f:AB and I want to get bijection. Can I just resting codomain to f(A)? I know that every function i...