Divide and conquer is common Algorithmic Technique which repeatedly splits a problem into smaller, discrete sub-problems, which are individually solved and re-assembled to solve the initial problem. Common algorithms using this technique include quick sort and binary search.
Divide and conquer algorithms can often be analysed using Recursive Complexity Definitions.