Return to Question

added 59 characters in body; edited tags; edited title

Source Link

edited Oct 11, 2019 at 14:20

Solve the Solving a recurrence relation rootinvolving square roots

give asymptotic upper bound for T(n) = √n·T(√n)+n+n/logn

Give an asymptotic upper bound for $$T(n) = \sqrt{n}·T(\sqrt{n})+n+n/\log n. $$

how IHow can I solve the root with loginthis recurrence relation, which involves square roots?

Source Link

asked Oct 11, 2019 at 1:57

give asymptotic upper bound for T(n) = √n·T(√n)+n+n/logn

how I can solve the root with login

algorithm-analysis