Question

Divide and conquer explain and algorithm with example

Answer 1

$\huge \purple {hello \: mate}$

You should think of a divide-and-conquer algorithm as having three parts: Divide the problem into a number of subproblems that are smaller instances of the same problem. Conquer the subproblems by solving them recursively. ... Combine the solutions to the subproblems into the solution for the original problem.

$\green{mark \: brainleast}$