//algorithm 1
void arrayResult(int a[], int n, string filename){
  	int sum;
	int bestSum = 0;
	int low = 0;
	int high = 0;

 	 for (int i = 0; i < n; i++) {
    	for (int j = i; j < n; j++) {
      		sum = 0;
      		for (int k = i; k <= j; k++) {
        		sum += a[k];
      		}
      		if (sum > bestSum) {
				bestSum = sum;
				low = i;
				high = j;
      		}
    	}
 	 }
//can easily set this to an output stream
	return bestSum;
}


//algorithm 2

void arrayResult(int a[], int n, string filename){
  	int sum;
	int bestSum = 0;
	int low = 0;
	int high = 0;

  	for (int i = 0; i < n; i++) {
    	sum = 0;
    	for (int j = i; j < n; j++) {
      		sum += a[j];
      		if (sum > maxSum) {
				maxSum = sum;
				low = i;
				high = j;
      		}
    	}
  	}
	return bestSum;