0 votes 0 votes What is time complexity for given recurrence relation T(n) = √nT(√n) + √n T(2)= 1 Algorithms recurrence-relation time-complexity + – Ashwani Kumar 2 asked Jun 29, 2016 • retagged Jun 16, 2022 by makhdoom ghaya Ashwani Kumar 2 846 views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply rameshbabu commented Jun 30, 2016 reply Follow Share I think you have miss typed this question, is it something like T(n) = n1/2 T( n1/2 ) + n1/2, 1 votes 1 votes Ashwani Kumar 2 commented Jul 3, 2016 reply Follow Share Now it is corrected. 0 votes 0 votes Please log in or register to add a comment.
2 votes 2 votes Correct me if i am wrong... gshivam63 answered Jul 5, 2016 gshivam63 comment Share Follow See 1 comment See all 1 1 comment reply Ashwani Kumar 2 commented Jul 6, 2016 reply Follow Share Thanks. Your answer is correct I was also doing the same but see how i will proceed further. I want to find the sum of that series. K is loglogn 0 votes 0 votes Please log in or register to add a comment.