Solve T(n)=2T(n/2)+n/log n - can master theorem apply?
Analyze the solve t(n)=2t(n/2)+n/log n - can master theorem apply?.
Examples
Input:"test_input_1"
Output:"output_1"
Input:"test_input_2"
Output:"output_2"
Hints
Consider the form of the recurrence relation: T(n) = aT(n/b) + f(n). Identify the values of a, b, and f(n) in the given recurrence.
Compare the growth rate of f(n) = n/log n with n^(log_b(a)) to determine which case of the Master Theorem applies, if any.
If the Master Theorem does not directly apply, explore alternative methods such as the Recursion Tree or Akra-Bazzi method to solve the recurrence relation.
Solve T(n)=2T(n/2)+n/log n - can master theorem apply?
Analyze the solve t(n)=2t(n/2)+n/log n - can master theorem apply?.