PA of Algorithms Q66

0. Which one of the following correctly determines the solution of the recurrence relation with T(1)= 1?

Answer
Comment
Array

Option : A
Explanation :
Since f(n) = log n
a = 2, b = 2
finding log_ba using master’s method = log₂2 = 1
Hence, f(n) = n'
So, T(n) = Θ(n)

Forgot your password?

I agree with the Terms.