Divide and conquer, the most well known algorithm design strategy:
a) Divide the problem into two or more smaller subproblems.
b) Conquer the subproblems by solving them recursively.
c) Combine the solutions to the subproblems into the solution for the original problemExamples: Binary search, Quick sort, Merge sort