Consider the recurrence function T (n) = {\\begin{array}{c}2T (\sqrt{n\end{array}) + 1,\:\:\:n > 2 ; 2,\:\:\:0 < n \leq 2 ; }. Then T(n) in terms of Θ notation is

GATE Computer Science (CS) 2017 Shift 2 Solved Paper

Question : 40 of 65

Marks: +1, -0

Consider the recurrence function

T (n) = {\{\table 2T ({√{n}}) + 1,\:\:\:n > 2 ; 2,\:\:\:0 < n ≤ 2 ; }.

Then T(n) in terms of Θ notation is

Go to Question:

Prev Question

Next Question