In the Master Theorem, which case applies to the recurrence T(n) = 2T(n/2) + n?
Show answer
Case 2
In this case, the driving function f(n) = n matches the watershed function n^(log_b a) = n^1. This results in a complexity of Theta(n log n).
Also asked as:
- According to the Master Theorem, which case describes the recurrence T(n) = 2T(n/2) + n?