Solve the following recurrence using Master’s theorem. T(n) = 4T (n/2) + n2
Posted: Wed Jul 13, 2022 7:40 pm
a) T(n) = O(n)
b) T(n) = O(log n)
c) T(n) = O(n2log n)
d) T(n) = O(n2)
b) T(n) = O(log n)
c) T(n) = O(n2log n)
d) T(n) = O(n2)