What does Divide and conquer refer to?
- A. An algorithm design paradigm that breaks a problem into smaller subproblems, solves them, and combines the results. ✓
- B. A graph traversal algorithm that explores as far as possible along each branch before backtracking.
- C. A mathematical notation used to describe the upper bound of an algorithm's time or space complexity.
- D. An algorithmic technique that solves problems by breaking them into overlapping subproblems and storing results.
Correct answer
A. An algorithm design paradigm that breaks a problem into smaller subproblems, solves them, and combines the results.
Explanation
Divide and conquer refers to an algorithm design paradigm that breaks a problem into smaller subproblems, solves them, and combines the results.