Skip to content
Related Articles
Open in App
Not now

Related Articles

Algorithms | Analysis of Algorithms (Recurrences) | Question 2

Improve Article
Save Article
  • Difficulty Level : Easy
  • Last Updated : 28 Jun, 2021
Improve Article
Save Article

What is the value of following recurrence.

T(n) = 5T(n/5) + \sqrt{n},
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
Related Articles

Start Your Coding Journey Now!