0
Using the Master Theorem, what is the time complexity of the recurrence T(n) = 4T(n/2) + n²?
- AO(n²)
- BO(n² log n)
- CO(n log n)
- DO(n³)
Correct answer: B
Discussion 0
Log in or create a free account to reply and vote.
Nobody has replied yet. Start the discussion!