# Divide and conquer

### From Glossary

An algorithm strategy, such as dynamic programming,
that divides a problem into parts. Suppose is
the time complexity
for a problem of size , and that dividing the problem into
subproblems, each of size , takes additional time. Then,
is called the *divide-and-conquer recurrence relation*.
If (a constant) and ,
for and if .
For example, if a bisection method is used (as in searching a sorted list),
the divide and conquer recurrence is for .
This implies since and .