Question discussion

Using the Master Theorem, what is the time complexity of the recurrence T(n) = 2T(n/2) + n log n?

555Medium DSSSB TGT Computer Science 0 replies 1 views

0

Using the Master Theorem, what is the time complexity of the recurrence T(n) = 2T(n/2) + n log n?

AO(n log n)
BO(n log² n)
CO(n²)
DO(n)

Correct answer: B

Join the discussion Report an error

Discussion 0

Nobody has replied yet. Start the discussion!