2 votes 2 votes Solve this problem? Algorithms algorithms recurrence-relation geeksforgeeks-test-series + – Deepak Yadav asked Jan 6, 2017 retagged Jul 6, 2022 by Lakshman Bhaiya Deepak Yadav 428 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 6 votes 6 votes T(n)=4T(n0.5) +(logn)2 put n=2k T(2k)=4T(2k/2) +(k)2 make T(2k)=s(k) s(k)=4s(k/2) +(k)2 use master thm 2nd case klogba=klog24 =k2 tc=theta(k2 logk) put k=logn tc=theta((logn)2.loglogn) saurabh rai answered Jan 6, 2017 edited Jan 6, 2017 by saurabh rai saurabh rai comment Share Follow See 1 comment See all 1 1 comment reply Deepak Yadav commented Jan 6, 2017 reply Follow Share Thanks Saurabh.. i got it. 0 votes 0 votes Please log in or register to add a comment.