Kadane's algorithm

#1

i am not able to understand kadane’s algorithm by the video please help

#2

@agarwalarjit.agarwal Simple idea of the Kadane’s algorithm is to look for all positive contiguous segments of the array (max_ending_here is used for this). And keep track of maximum sum contiguous segment among all positive segments (max_so_far is used for this). Each time we get a positive sum compare it with max_so_far and update max_so_far if it is greater than max_so_far

#3

@agarwalarjit.agarwal read this article to understand more.