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)
(n^2)
(D)
(n^2log n)