# Time bound basic

Computer Science Level 2

If the running time of an algorithm can be represented by the following recurrence relation:

$T(n)=\left\{\begin{matrix} n & \text{ if } & n\leq3\\ T(n/3)+cn & \text{otherwise}& \end{matrix}\right.$

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

×