// ArrayDemo2
//
// Ethan Bolker
// March 2004, for cs110

public class ArrayDemo2
{
    public static void main( String[] args ) 
    {
	// declare and create an array of ints to parallel 
	// args array of Strings
	int[] a = new int[args.length];

	// fill it, using static Integer.parseInt method to convert
	// String to int: Integer.parseInt("1001") returns 1001
	for (int i = 0; i < args.length; i++ ) {
	    a[i] = Integer.parseInt( args[i] );
	}

	// standard idiom to sum the entries in an array
	int total = 0;
	for (int i = 0; i < a.length; i++ ) {	
	    total += a[i];   // total = total + a[i]
	}
	System.out.println("total: " + total);

	// find the maximum value 
	// start at -infinity, not at 0, since entries may be negative
	int maxSoFar = Integer.MIN_VALUE; 
	for (int i = 0; i < a.length; i++ ) {	
	    if ( a[i] > maxSoFar) {
		maxSoFar = a[i];
	    }
	}	
	System.out.println("maximum: " + maxSoFar);

	// finding the minimum value
	int minSoFar = Integer.MAX_VALUE; // start at infinity!
	for (int i = 0; i < a.length; i++ ) {	
	    minSoFar = Math.min( a[i], minSoFar );
	}
	System.out.println("minimum: " + minSoFar);
    }
}