Can someone please explain this pseudo code to me:

FIND-MAX-SUBARRAY(A, low, high) left = 0 right = 0 sum = - for i = low to high current-sum = 0 for j = i to high current-sum += A[j] if sum < current-sum sum = current-sum left = i right = j return (left, right, sum)

its fort he brute-force method of solving the maximum-subarray problem with a run time in (n2)