How to solve the recurrence T(n) = 2T(n^(1/2)) + log n? [closed]

Answer 1

dude if it were quick sort that was the equation:

The solution for this is O(n*log(n)) since now it is even smaller(T(n) ~ n^1/2) for some N it means your complexity is less than O(n*log(n)).

Try to use induction to prove your bound