EGEL Plus Ciencias Computacionales

CENEVAL EGEL Plus Ciencias Computacionales (EGEL Plus COMPU)

AlgoritmiaEnglish
Exam overview

Practice session

Given the recurrence T(n) = 4T(n/2) + n², which tight bound does the Master Theorem give for T(n)?

Loading your practice session…