Regarding maximum sum of a subarray

#1

There is a program in course of finding the maximum sum of subarray using the time complexity O(N2) but I have a doubt that when i = 0; cum_sum[i-1] can give garbage value or not ?? or will it give only 0. I have made comments where I have doubt in the program.https://ide.codingblocks.com/s/440149

#2

hello @sarthak_singhal

it will give garbage value .
handle this case seprately.

#3

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.