An algorithm design paradigm based on multi-branched recursion, where a problem is divided into smaller sub-problems, solved independently, and combined to get the solution to the original problem.

"The quicksort algorithm uses the divide and conquer approach to sort elements by dividing the list into two smaller sub-lists, sorting them independently, and then merging them."