Home / MCQ Bank / Computer
Computer Dynamic Programming In Data Structures Difficulty: Medium

What is the space complexity of the following naive method used to find the maximum sub-array sum in an array containing n elements? #include<stdio.h> int main() { int arr[1000]={2, -1, 3, -4, 1, -2, -1, 5, -4}, len=9; int cur_max, tmp_max, strt_idx, sub_arr_idx; cur_max = arr[0]; for(strt_idx = 0; strt_idx < len; strt_idx++) { tmp_max=0; for(sub_arr_idx = strt_idx; sub_arr_idx < len; sub_arr_idx++) { tmp_max +=arr[sub_arr_idx]; if(tmp_max > cur_max) _____________; } } printf("%d",cur_max); return 0; }

Select the correct option to test your answer:

More Computer Questions

Which of the following lines of code will result in an error? Which of the following is true about servlets? Cascade update option What will be the data type returned for the following C function? #include <stdio.h> int func() { return (double)(char)5.0; } What is the time complexity of interpolation search in the best case scenario?