in Algorithms retagged by
3,367 views
2 votes
2 votes
solution of t(n)= t(sqrt(n)) + n using back substitution
in Algorithms retagged by
3.4k views

2 Answers

2 votes
2 votes
Best answer

Answer
Correct me if I am wrong

selected by

4 Comments

Actually I have got it from the base condition of the recurrence.
It is not mentioned in the question.
You have to consider that
T(n)=1       n=2

T(n) = (n1/2)+n     n>2

0
0
Got it. Thanks bro.
0
0
its welcome , bro
0
0
0 votes
0 votes
put t=2pow(k)

T(2k)=T((2k)1/2)+n

 

again put T(2k)=P(k)

and solve...