What is the function or purpose of Dynamic programming?
- A. A divide-and-conquer sorting algorithm that splits the array, sorts each half, and merges them.
- B. A search algorithm that repeatedly divides a sorted array in half to locate a target value.
- C. An algorithmic technique that solves problems by breaking them into overlapping subproblems and storing results. ✓
- D. An algorithmic approach that makes the locally optimal choice at each step, hoping to find a global optimum.
Correct answer
C. An algorithmic technique that solves problems by breaking them into overlapping subproblems and storing results.
Explanation
Dynamic programming refers to an algorithmic technique that solves problems by breaking them into overlapping subproblems and storing results.