Question discussion

The solution of the recurrence T(n) = 2T(n/2) + n log n is

1366Medium DSSSB TGT Computer Science 0 replies

The solution of the recurrence T(n) = 2T(n/2) + n log n is

  • AΘ(n)
  • BΘ(n log² n)
  • CΘ(n log n)
  • DΘ(n²)
Correct answer: B

Explanation

Here f(n) = n log n = Θ(n^(log₂2) · log n), the extended case 2 of the Master theorem with k = 1, giving Θ(n log^(k+1) n) = Θ(n log² n).

Discussion 0

Nobody has replied yet. Start the discussion!