please solve this

Question

$T(n)=2T(\sqrt{n})+logn$

Comments

https://stackoverflow.com/questions/13103909/how-to-solve-the-recurrence-tn-2tn1-2-log-n/34282954#34282954

---

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)

---

https://gateoverflow.in/46895/t-n-2t-floor-sqrt-n-log-n