Which of the following is described as a process by which a problem is divided into subproblems which are recursively solved, then recombined for a final solution? (1 point)

Question

Responses

selection sort algorithm
selection sort algorithm

binary search algorithm
binary search algorithm

bubble sort algorithm
bubble sort algorithm

divide

Answer 1

The process you described is known as "divide and conquer." This technique involves dividing a problem into smaller subproblems, solving each subproblem recursively, and then combining the results to obtain a final solution. Among the options listed, none exactly match "divide and conquer," but the binary search algorithm is a classic example of this approach.

If I had to choose one that aligns most closely with your description, it would be:

binary search algorithm