Q31
Which of the following is an example of a problem where Dynamic Programming is particularly useful?
A.
Merge Sort
B.
Heap Sort
C.
Binary Search
D.
Longest Increasing Subsequence
AnswerAnswer: Option D
Solution
Answer: Option D
No explanation is given for this question Let's Discuss on Board