![Mcqmate logo](https://mcqmate.com/public/images/logos/logo-black.png)
![Mcqmate logo](https://mcqmate.com/public/images/logos/logo-white.png)
McqMate
Q. |
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 |
D. | wagner fischer algorithm |
Answer» C. kadane’s algorithm | |
Explanation: the dynamic programming implementation of the maximum sum rectangle problem uses kadane’s algorithm. |
View all MCQs in
Design and Analysis of AlgorithmsNo comments yet