Divide and Conquer Algorithms with Source Code

Divide and conquer is an algorithm design paradigm based on multi-branched recursion.

A divide and conquer algorithm works by recursively breaking down a problem into two or more sub-problems of the same type, until these become simple enough to be solved directly. The solutions to the sub-problems are then combined to give a solution to the original problem

https://www.codechief.org/article/divide-and-conquer-algorithms-with-source-code