Exam (elaborations)
Algorithms: Test 1| Master Theorem
- Course
- Institution
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 r...
[Show more]