Which term refers to an algorithm design paradigm that breaks a problem into smaller subproblems, solves them, and combines the results?
- A. Dynamic programming
- B. Divide and conquer ✓
- C. Binary search
- D. Merge sort
Correct answer
B. Divide and conquer
Explanation
Divide and conquer refers to an algorithm design paradigm that breaks a problem into smaller subproblems, solves them, and combines the results.