find the largerst consecutive array with largest sum

by Simplybj

HTML

<div id="result"></div>

JavaScript

let array = [34, -50, 42, 14, -5, 86];
function ArraySum(arr) {
  return arr.reduce(function(i, v) {
    return i + v;
  });
}
function SplitArray(arr) {
  let length = arr.length;
  let bigger = 0;
  let finalArray = [];
  for (var i = 0; i < length; i++) {
    var arAsc = arr.slice(0, length - i);
    let sum = ArraySum(arAsc);
    if (sum > bigger) {
      bigger = sum;
      finalArray= arAsc;
    }
    var arDesc = arr.slice(length - i - 1, length);
    sum = ArraySum(arDesc);
    if (sum > bigger) {
      bigger = sum;
      finalArray= arDesc;
    }
  }
  return {'array':finalArray,'sum': bigger};
}
let result = SplitArray(array);
let resultHTML = document.getElementById("result");
resultHTML.innerText= `For the given array [${array}] the sub array [${result.array}] has the largest sum of ${result.sum}`;