GATE CS

Algorithms, GATE CS Quiz

10 questions

Question 1 of 10Score: 0 / 0

What is the solution to the recurrence T(n) = 4T(n/2) + n^2?

← Back to unit notes