Practice Algorithms - GATE - CSIT, DSAI & Interview Preparation Offered by Unacademy

Algorithms

The asymptotic upper bound solution

$\mathrm{T}(\mathrm{n})=2 \mathrm{T}\left(\frac{\mathrm{n}}{2}\right)+\frac{\mathrm{n}}{\log \mathrm{n}}\ \mathrm{is}$

O(nloglogn)

none of the above

$\mathrm{O}\left(\mathrm{n}^{2}\right)$

O(n)