Divide and Conquer Algorithm

What is it?

The divide and conquer algorithm strategy is based on reducing the original dimension $n$ of a problem to other sub-problems, which are recursively divided to other sub-problems.

This commonly reduces the Big-O Notation of a $O(n)$ algorithm to $O(\log n)$. This happens because instead of going to every possible data point, we can recursively solve smaller problems and combine them to find the answer of the original problem.