Use the substitution method to show that the recurrence T(n) = √ n T( √ n) + n has solution T(n) = O(n lg lg n).
Answers
Answered by
2
Answer:
Use the substitution method to show that the recurrence T(n) = √ n T( √ n) + n has solution T(n) = O(n lg lg n).
Explanation:
Use the substitution method to show that the recurrence T(n) = √ n T( √ n) + n has solution T(n) = O(n lg lg n).
Similar questions