Q153
Which line should be inserted in the blank to complete the following dynamic programming implementation of the maximum sub-array sum problem? #include int max_num(int a,int b) if(a> b) return a; return b; int maximum_subarray_sum(int *arr, int len) int sum[len], idx; sum[0] = arr[0]; for(idx = 1; idx mx) mx =sum[idx]; return mx; int main() int arr[] = -2, -5, 6, -2, 3, -1, 0,-5, 6, len = 9; int ans = maximum_subarray_sum(arr, len); printf("%d",ans); return 0;
A.
max_num(sum[idx - 1] + arr[idx], arr[idx])
AnswerB.
sum[idx - 1] + arr[idx].
C.
min_num(sum[idx - 1] + arr[idx], arr[idx])
D.
arr[idx].
Answer: Option A
Solution
Answer: Option A
No explanation is given for this question Let's Discuss on Board