Skip to main content

What kind of problems can be solved using divide and conquer method ?

Binary Search :

A decrease and conquer algorithm
where the sub problems are roughly half of the original size .

Euclidean Algorithm :

It is used to compute the greatest common divisor of two numbers.
(by reducing the numbers to smaller and smaller equivalent sub problems)