1 votes 1 votes $T(n)=2T(\sqrt{n})+logn$ Algorithms recurrence-relation + – Rameez Raza asked Jan 27, 2018 Rameez Raza 443 views answer comment Share Follow See all 6 Comments See all 6 6 Comments reply Show 3 previous comments sumit chakraborty commented Jan 27, 2018 reply Follow Share https://stackoverflow.com/questions/13103909/how-to-solve-the-recurrence-tn-2tn1-2-log-n/34282954#34282954 1 votes 1 votes sumit chakraborty commented Jan 27, 2018 reply Follow Share Or you can use the substitution method taking logn =m. Then the equation becomes : S(m) = 2S(m/2) + m. Using master's theorem the complexity comes to mlogm . Putting back the values you can get O(logn loglogn) 0 votes 0 votes sumit chakraborty commented Jan 27, 2018 reply Follow Share https://gateoverflow.in/46895/t-n-2t-floor-sqrt-n-log-n 0 votes 0 votes Please log in or register to add a comment.