104 views
T(n)=2T(log n)+c

c is a constant. Base condition is if(n<2) return 1

What will be the tightest bound on time complexity?

logn?

Ans:Theta(n2)

Explanation is in the image