Recursive behavior time complexity estimate

Example of a recursive behavior

Use master formula

T(N) = a * T(N/b) + O(N^d)

1) log (b, a)> d -> complexity is O (N ^ log (b, a))

2) log (b, a) = d -> complexity is O (N ^ d * log N)

3) log (b, a) <d -> complexity is O (N ^ d)