i have the following question:

Find lower and upper asymptotic bounds for the following recursive function:


For the upper and lower bounds, can i say that:$$T(n)\le{n+kT(\frac{n}2)}$$ $$T(n)\ge{n+T(\frac{n}{2^k})}$$ And then continue by opening the function? If not, can anyone point me to the right direction?


Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.