Q143
The dynamic programming implementation of the maximum sum rectangle problem uses which of the following algorithm?
A.
Hirschberg's algorithm
B.
Needleman-Wunsch algorithm
C.
Kadane's algorithm
AnswerD.
Wagner Fischer algorithm
Answer: Option C
Solution
Answer: Option C
No explanation is given for this question Let's Discuss on Board