Computer Science, asked by muneebkh786, 6 months ago

1. 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 ahshsudndh
1

Explanation:

utt455dytfyg6gvvybgtug7g 6

Similar questions