- Guías de estudio, Notas de estudios & Resúmenes
¿Buscas las mejores guías de estudio, notas de estudio y resúmenes para ? En esta página encontrarás 1 documentos de estudio para .
Examen
Algorithms: Test 1| Master Theorem
Algorithms Master Theorem
Algorithms Master Theorem
O(n^logb(a)) - if a>b^k O((n^k)log(n)) - if a=b^k O(n^k) - if a<b^k T(n)= - aT(n/b)+cn^k a>=1 - b>=2 Theorem (General definition) - let a ≥ 1 and b > 1 be constants, let f(n) be a function and let T(n) be defined on the nonnegative integers by the recurrence: T(n) = a T(n/b) + f(n) Note: T(1) = c Has 3 important asymptotic bound properties. (plus a 4th less used one) When is it used? - When we want to describe asymptotic behaviour...
TeeGrades
$8.49