Time bound basic

Computer Science Level 2

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

T ( n ) = { n if n ≤ 3 T ( n / 3 ) + c n otherwise 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?

O ( n 2 log ⁡ n ) O(n^{2}\log n) O ( n ) O(n) O ( n 2 ) O(n^{2}) O ( n log ⁡ n ) O(n\log n)

View wiki
Beakal Tiliksew by Beakal Tiliksew , 24, Ethiopia

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

0 solutions

No explanations have been posted yet. Check back later!

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...