Computer Science, asked by ramkumar466, 8 months ago

6 3479 14 11 12
643 7 119 14 12
7 6 14 11943 12
2. Given T(n) = 4T(n/2) + V2 n^3.+n. The time complexity using Master's theorem is
(1 Point)
Oln^3)
Dn121
0n2
O(n^4)​

Answers

Answered by saina1149
0

Explanation:

I cannot able to understand the question

Similar questions