Question

the approach to divide a complex and big problem and sub-problem us called as​

Answer 1

Answer:

A divide-and-conquer algorithm recursively breaks down a problem into two or more sub-problems of the same or related 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