Ononot — A recursive algorithm has the complexity T(n) = 3T(n/2) + n^

Guest Session: 1 Question Remaining. Create Account to save progress.

Recursionhard

0:00.0

A recursive algorithm has the complexity $T(n) = 3T(n/2) + n^2$ . Using the Master Theorem, what is the complexity?