// Steve J. Hodges
// CS19: C++ Programming
// findmax.cpp

#include <iostream>
using namespace std;

int findMax(int [], const int);


main(){
  const int ASIZE=11;
  int a[]={-1,-2,-3,-4,-5,-6,-7,-8,-9,-10,-11};
  cout << "findmax:" << endl;
  cout << "array: ";
  for(int i =0; i<ASIZE; i++){
    cout << a[i] << " ";
  }
  cout << endl;
  cout << "Max:" << findMax(a, ASIZE) << endl;
}

// "High Water Mark Algorithm"
int findMax(int ta[], const int S){
  int max = ta[0];
  //  for (int i=1; i< S; i++){
  for (int i=1; i < S ; i++){
    if (ta[i] > max){
      max = ta[i];
    }
  }
  return max;
}