Find Largest Subarray (dynamic)

subarray_n2.js

function findLargestSubarray(arr) {
    var result = {max:-1,start:-1,stop:-1};
    var row_data = [];
    for (var i = 0; i < arr.length; i++) 
        for (var k = i; k < arr.length; k++) {
            if (k == i) {
                row_data.push(new Array(arr.length));
                row_data[i][k] = arr[i];
            }
            else 
                row_data[i][k] = row_data[i][k - 1] + arr[k];

            if (row_data[i][k] > result.max) 
                result = {max:row_data[i][k],start:i,stop:k};
        }

    console.log(row_data);
    return result;
}

var arr = [20,-1,-1,-1,4];
var result = findLargestSubarray(arr);
console.log(result);