☑Kizspy.me
(Choose 1 answer)
(See picture)
☐ A
A. (iv)
B. (iii)
C. (ii)
D. (1)
Back
Next
FUO.sh
sh the exam.
For the recurrence relation
f(n) = 4f (n/2) + n
what is the asymptotic complexity of f (n) using the Master
Theorem?
(i) O(logn);
(ii) O(n);
(iii) O(nlogn);
(iv) O(n²).
