Functional Equations in \( \sqrt{n} \)

Computer Science Level pending

\({ T(n) = \lg(n) + T(\sqrt{n}) } \)

Which is the tightest asymptotic bound of \(T(n)\)?

×

Problem Loading...

Note Loading...

Set Loading...