bruteForce

by Krishna Ananthi

HTML

// subarray// subarray in a array which has max sum using brute force approach

JavaScript

function bruteForce(a) {
  let n = a.length;
  let max= 0;let sum =0;
  for (let i = 0; i < n; i++) {
    for (let j = 0; j < n; j++) {
    	 sum = 0;
      for (let k = i; k <= j; k++) {
				//console.log(a[k]); //gives all combination
        sum+=a[k];
      } //console.log("&&",sum,max)
      if(sum>max){
      		max = sum;
      }
    }
  }
  console.log("****",max)
}

bruteForce([-1,2,3,4])