1 votes 1 votes T(n) = 4T(sqrt(n)) + (logn)^5 Find Time complexity.(n=2^k) Give detailed answer , how to derive it. Algorithms algorithms time-complexity master-theorem + – parthbkgadoya asked Feb 1, 2017 parthbkgadoya 655 views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply Rahul Jain25 commented Feb 1, 2017 reply Follow Share Is it O(log n )5??? 0 votes 0 votes Shashank Kumar Mishr commented Mar 8, 2017 reply Follow Share yeaah answer is o(log n)^5 0 votes 0 votes Please log in or register to add a comment.
2 votes 2 votes hope this will help! Smriti012 answered Feb 1, 2017 Smriti012 comment Share Follow See 1 comment See all 1 1 comment reply LavTheRawkstar commented Feb 1, 2017 reply Follow Share mam please tell this also https://gateoverflow.in/114052/using-recurrence-method-solve-following-recurrence-relation 0 votes 0 votes Please log in or register to add a comment.