Problem Statement

Recurrence Running Time An algorithm satisfies T(n) = 3T(n/3) + O(n) and therefore runs in: Θ(n) Θ(n^(log_3 2)) Θ(n log n) Θ(n²)