Which of the following best names the concept in which an algorithmic technique that solves problems by breaking them into overlapping subproblems and storing results?
- A. Dynamic programming ✓
- B. Greedy algorithm
- C. Divide and conquer
- D. Breadth-first search (BFS)
Correct answer
A. Dynamic programming
Explanation
Dynamic programming refers to an algorithmic technique that solves problems by breaking them into overlapping subproblems and storing results.