Algorithms | Analysis of Algorithms (Recurrences) | Question 2

What is the value of following recurrence.

T(n) = 5T(n/5) + ,
T(1) = 1,
T(0) = 0

(A) Theta (n)
(B) Theta (n^2)
(C) Theta (sqrt(n))
(D) Theta (nLogn)


Answer: (A)

Explanation: The given solution can be solved using Master Method. It falls in Case 1.


Quiz of this Question

My Personal Notes arrow_drop_up

Save