2 2 votes What is the answer to the following equation? $T(n) = T(\sqrt n)+ \log \log n$ Algorithms recurrence-relation + – Hardik Vagadia 1.2k views answer comment Share Follow Print 0 reply Please log in or register to add a comment.
Best answer 2 2 votes Solution sh!va answered Jul 28, 2016 • selected Jul 28, 2016 by Prashant. sh!va comment Share Follow See all 2 Comments 2 2 Comments reply Hardik Vagadia commented Jul 28, 2016 reply Follow flag Why we cannot use the case 3 of the master's theorem? 0 0 replyShare sh!va commented Jul 28, 2016 reply Follow flag https://en.m.wikipedia.org/wiki/Master_theorem Please refer the condition for case 2 in master's theorem. 0 0 replyShare Please log in or register to add a comment.
0 0 votes Here you go - the actual solution is (log.logn)^2 Prateek Gupta 1 answered Jul 29, 2016 Prateek Gupta 1 comment Share Follow See 1 comment 1 1 comment reply Sushant Gokhale commented Aug 28, 2016 reply Follow flag @prateek. loglog( n^1/2) = -1 + loglogn. SImilarly, proceeding down the tree, we get the other terms like -2 + loglogn, -3 + loglogn and so on. So, you missed these. 0 0 replyShare Please log in or register to add a comment.
