Question

The Master Theorem gives time complexity for recurrences of the form:

A T(n) = T(n–1) + O(1)
B T(n) = aT(n/b) + f(n)
C T(n) = aT(n) + bT(n/b)
D T(n) = nT(n) + O(1)
E T(n) = T(log n) + O(n)
Practice Next

Hey! Ask a query