0 votes 0 votes The solution of recurrence relation, $T(n) = 2T (floor (\sqrt{n}))+\log n$ is $O(n \log \log \log n)$ $O(n \log \log n)$ $O(\log \log n)$ $O(\log n \log \log n)$ Algorithms ugcnetcse-june2013-paper3 algorithms recurrence-relation + – go_editor asked Jul 16, 2016 • recategorized May 30, 2020 by Arjun go_editor 1.7k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
2 votes 2 votes Ans is D Sanjay Sharma answered Jul 16, 2016 Sanjay Sharma comment Share Follow See all 2 Comments See all 2 2 Comments reply shruti gupta1 commented Oct 10, 2018 reply Follow Share can we solve it by master theorem 0 votes 0 votes Sanjay Sharma commented Oct 10, 2018 reply Follow Share first we need to convert it into a form in which master method can be applied then it is become case 2 of master theorem 1 votes 1 votes Please log in or register to add a comment.