Solve the following recurrence using Master’s theorem. T(n) = 2T (n/2) + n/ log n
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) cannot be solved using master’s theorem
b) T(n) = O(log n)
c) T(n) = O(n2log n)
d) cannot be solved using master’s theorem