2 votes 2 votes solution of t(n)= t(sqrt(n)) + n using back substitution Algorithms algorithms recurrence-relation + – NIHAR MUKHIYA asked Jul 2, 2017 • retagged Jul 6, 2022 by Lakshman Bhaiya NIHAR MUKHIYA 3.4k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 2 votes 2 votes Answer Correct me if I am wrong Arnab Bhadra answered Jul 2, 2017 • selected Jul 2, 2017 by NIHAR MUKHIYA Arnab Bhadra comment Share Follow See all 5 Comments See all 5 5 Comments reply Show 2 previous comments Arnab Bhadra commented Jul 3, 2017 reply Follow Share 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 votes 0 votes Saikat commented Jul 3, 2017 reply Follow Share Got it. Thanks bro. 0 votes 0 votes Arnab Bhadra commented Jul 3, 2017 reply Follow Share its welcome , bro 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes put t=2pow(k) T(2k)=T((2k)1/2)+n again put T(2k)=P(k) and solve... abhishek tiwary answered Jul 2, 2017 abhishek tiwary comment Share Follow See all 0 reply Please log in or register to add a comment.