Kadane’s algorithm uses which of the following techniques?
(a) Divide and conquer
(b) Dynamic programming
(c) Recursion
(d) Greedy algorithm
I got this question in semester exam.
I'm obligated to ask this question of Kadane’s Algorithm topic in section Dynamic Programming of Data Structures & Algorithms II