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
Solve the following recurrence using Master’s theorem. T(n) = 2T (n/2) + n/ log n
-
answerhappygod
- Site Admin
- Posts: 899604
- Joined: Mon Aug 02, 2021 8:13 am
Solve the following recurrence using Master’s theorem. T(n) = 2T (n/2) + n/ log n
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!