Maximum subarray (Kadane's Algorithm) in python

max_subarray.py

# Done using Kadane's Algorithm

nums = [-2, -3, 4, -1, -2, 1, 5, -3]    # Change array here
max_so_far,max_ending_here = 0,0
beg,end=0,0

for x in range(0,len(nums)):
  max_ending_here += nums[x]
  if max_ending_here > max_so_far:
    max_so_far = max_ending_here
    end=x+1
  if max_ending_here < 0:
    max_ending_here = 0
    beg=x+1

print("Length of max subarray : ", max_so_far)     
print("Max subarray", nums[beg:end])

# Time complexity, Space complexity = O(n), O(1)