GATE | CS | 2009 | Algorithms | Recurrence | Question 35 (original) (raw)

The running time of an algorithm is represented by the following recurrence relation:

if n <= 3 then T(n) = n else T(n) = T(n/3) + cn

Which one of the following represents the time complexity of the algorithm?

(A) Θ(n)

(B) Θ(n log n)

(C) Θ(n2)

(D) Θ(n2log n)

Share your thoughts in the comments