← Quiz: Recurrence Relations: all 10 questions
Quiz: Recurrence Relations · Question 4 of 10
By the Master Theorem, what is T(n) = 2T(n/2) + Θ(n)?
By the Master Theorem, what is T(n) = 2T(n/2) + Θ(n)?
- A.Θ(n)
- B.Θ(n log n)
- C.Θ(n²)
- D.Θ(log n)
Answer & explanation
Correct answer: Θ(n log n)
d = 1 = log₂2, the balanced case: Θ(n log n) — merge sort.
Can you get the rest right without peeking?
Take the timed Quiz: Recurrence Relations quiz free. Pass it to earn XP and count towards your certificate.
Start the quiz →