public class ÜbungTestat12
{
  public static void main (String [] args) {

      System.out.println();

    }

  public static int countNegatives( int feld []){
      int count = 0;

      for( int i = 0 ; i < feld.length ; i ++){

          if( feld[i] < 0){

              count ++;

            }

        }

      return count;
    }

  public static int sumUpNegatives( int feld2 []){
      int sum = 0;

       for( int i = 0 ; i < feld2.length ; i ++){

          if( feld2[i] < 0){

              sum = sum + feld2[i];

            }

        }
        return sum;
    }

  public static int maximum( int feld3 []){
    int max = 0;
    int i = 0;

    while( i < feld3.length-1){
          if ( feld3[i] >= feld3[i + 1]){

            i ++;
          }

           else{
            max = feld3[i+1] ;
            i++;
          }
    }
        return max;
    }

  public static void maximum2(int values []){
    int max = 0;

    for (int i = 0; i < values.length; i++) {

	if (max < values[i]) {

	    max = values[i];

	}
    }

    System.out.println(max);
  }

    public static int countMaximum( int feld4 []){

       int max = 0;
       int count = 0;

       for (int i = 0; i < feld4.length; i++) {

	if (max <= feld4[i]) {

	    if ( max == feld4[i]){
	        count++;
	        max = feld4[i];
	}
	max = feld4[i];
      }

    }
    count++;
    return count;

  }

  public static boolean isSorted( int feld5 []){

      boolean isSorted = true;

      for (int i = 0 ; i < feld5.length-1 ; i++){
            if ( feld5[i] > feld5[i+1]){
                isSorted = false;
            }
        }
        return isSorted;
    }
}