Question

What is the primary strategy of a divide-and-conquer algorithm?

A Solve a problem by iteratively narrowing it down.
B Solve a problem by recursively breaking it into smaller subproblems, solving the subproblems, and then combining their solutions.
C Solve a problem by selecting the largest subproblem.
D Solve a problem by trying all possible combinations of subproblems.
Practice Next

Relevant for Exams:

Hey! Ask a query