be the running time estimate of a divide-and-conquer algorithm.
satisfies a relation of the form:
is the cost of the combine-part,
number of recursive calls and
is the size of a sub-problem, with
Assume that the following holds for all
Then we have
Marc Moreno Maza