Maximum Sub Array Contiguous, a Greedy Implementation

max-sum.js

const trivialCase = [ 5, -6, 7, 12, -3, 0, -11, -6 ];

function sumValues(a, b) { 
  return a + b
}

function sumSubArraysStartingAtValue(arr, i) {

  let sums = []
  for(let j = i+1; j < arr.length; j++ ) {
    if(sums.length > 1) {
         let lastValueInSums = sums[sums.length-1]
         sums.push(sumValues(lastValueInSums, arr[j]))
      } else {
        sums.push(arr[j])
      }
  }
  return sums
}

function getGreatestSum(sums) {
  return Math.max(...sums)
}

function sumAllSubArrays(arr) {
  let netSums = []
  let greatestSum = -Infinity;
  
  for(let i = 0; i < arr.length; i++ ) {
    let temp = sumSubArraysStartingAtValue(arr, i) 
    let currentGreatestSum = getGreatestSum(temp)
    if(greatestSum < currentGreatestSum){
      greatestSum = currentGreatestSum
    }
  }
  return greatestSum;
}

function runner(trivialCase){
  return sumAllSubArrays(trivialCase)
}

runner(trivialCase)