How to solve this recurrence relation: T(n) = 4*T(sqrt(n)) + n

前端 未结 4 985
我在风中等你
我在风中等你 2020-12-22 07:46

I know how to solve the recurrence relations using Master Method. Also I\'m aware of how to solve the recurrences below:

T(n) = sqrt(n)*T(sqrt(n)) + n

T(n) =

4条回答
  •  爱一瞬间的悲伤
    2020-12-22 08:31

    Suppose that n = 2^k. We have T(2^k) = 4*T(2^(k/2)) + 2^k. Let S(k) = T(2^k). We have S(k) = 4S(k/2) + 2^k. By using Mater Theorem, we get S(k) = O(2^k). Since S(k) = O(2^k) and S(k) = T(2^k), T(2^k) = O(2^k) which implies T(n) = O(n).

提交回复
热议问题