GATE IT 2005 | Question: 51

Question

Let $T(n)$ be a function defined by the recurrence

$T(n) = 2T(n/2) + \sqrt n$ for $n \geq 2$ and
$T(1) = 1$

Which of the following statements is TRUE?

• A. $T(n) = \Theta(\log n)$
• B. $T(n) = \Theta(\sqrt n)$
• C. $T(n) = \Theta(n)$
• D. $T(n) = \Theta(n \log n)$

Comments

(considering base of $logn$ is $2$) .

(1 --logn)-→ total logn terms.

(0—logn)→ total logn+1 terms 

 

---

case 1 Master theo
 

---

Done ✅

Answer 1

Option $C$ is the answer. It can be done by Master's theorem.

$n^{\log_b a} = n^{\log_2 2} = n$.

$f(n) = \sqrt n = n^{\frac{1}{2}}$.

So, $f(n) = O\left(n^{\log_b a -\epsilon}\right)$ is true for any real $\epsilon$, $0 < \epsilon < \frac{1}{2}$. Hence Master theorem Case 1 satisfied,
$$T(n) = \Theta\left(n^{\log_b a}\right) = \Theta (n).$$

Comments

How to do it using back substitution?

---

Master's theorem the Cormen way. Never fails in any case.

---

Sambhrant Maurya

it will form a GP series like

n*(1+1/√2  +  1/√4 +1/√8 +1/√16 + ………………..+ 1/√n )

here the series is decreasing GP series thus 

T(n) = ⊖(n)

Answer 2

Answer is C it can also be solved by master theorem. by case 1(a>=b^k)

T(n)= aT(n/b)+n^k

Here a = 2 b=2 and k =1/2

so a>= b^k

T(n)=Θ (n^logba)

hence T(n)=Θ(n)

Answer 3

option c is right

Answer 4

 

let me know if i am doing any mistake.

Comments

Shouldn't it be Math.root(n/2) instead of Math.root(n)/2 ?

Answer 5

T(n)=O(n)

Answer 6

Following is the solution of this question using Master's Method: