The The time efficiency of recursive algorithms can be expressed in a recurrence relation of Big O notation. They can (usually) then be simplified into a single Big-O term.

$T(n)=a\cdot T(n/b)+f(n)$

Then the Big O of the time-complexity is thus: