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