0 votes 0 votes T(n) =$\log$n + T($\sqrt{n}$) How to solve this? Programming in C recurrence-relation + – kirti_k asked Nov 21, 2017 • retagged Nov 22, 2017 by Arjun kirti_k 230 views answer comment Share Follow See 1 comment See all 1 1 comment reply Rupendra Choudhary commented Nov 21, 2017 reply Follow Share Method #1 : solve recursively T(n) =logn + T(√n) T(n)=logn+logn1/2+logn1/4+logn1/8+.... T(n)=log(n*n1/2*n1/4*n1/8*.....) T(n)=log(n*n)=logn2=O(logn) Method #2 reshape into master theorem let n=2m // logn=m T(2m)=T(2m/2)+m Let T(2m)=S(m) S(m)=S(m/2)+m // by master theorem it's O(m) and O(m) means O(logn) 3 votes 3 votes Please log in or register to add a comment.