The running time of an algorithm as a function of the input size, T(n), satisfies the following equations:

The running time of an algorithm as a function of the input size, T(n), satisfies the following equations:

(This running time could arise, for example, if the algorithm operates on an input of size n by, first, calling itself recursively on an input of 1/4-th that size; then, calling itself recursively on two inputs of 1/8-th that size; and finally, performing additional processing that takes 5n steps.)