Quick practiceEnglish
Exam overview

Practice session

Consider the divide-and-conquer recurrence relation T(n) = 4 T(n/2) + Θ(n^2). According to the Master Theorem, what is the asymptotic time complexity of T(n)?

Loading your practice session…