← GATE CSE 2017 Set 2

Q30

MCQ2 marks, −0.67

Consider the recurrence function

T(n) = \begin{cases} 2T(\sqrt{n})+1, & n>2 \\ 2, & 0 < n \leq 2 \end{cases}

Then $T(n)$ in terms of $\Theta$ notation is

(A)

$\Theta(\log \log n)$

(B)

$\Theta( \log n)$

(C)

$\Theta (\sqrt{n})$

(D)

$\Theta(n)$

Sign in to save attempts.

Loading…