Bruteforce Largest Subarray o(n^3)

subarray.js

function findLargestSubarray(arr) {
    var max = 0;
    var start, end;
    for (var i = 0; i < arr.length; i++)
        for (var j = i; j < arr.length; j++)
        {
            var current = 0;
            for (var k = i; k <= j; k++)
                current += arr[k];
            if (current > max) 
            {
                start = i;
                end = j;
                max = current;
            }
        }
    return { start: start, end: end };
}