# Tightest Asymptotic Bound [on hold]

Let T(n)T(n) describe the time taken by an algorithm for input of size nn.

Find the tightest asymptotic bound for:

T(n)=n(T(n2)2)T(n) = n(T(\frac n2)^2)

=================

=================

=================