1	// ArrayDemo2
     2	//
     3	// Ethan Bolker
     4	// March 2004, for cs110
     5	
     6	public class ArrayDemo2
     7	{
     8	    public static void main( String[] args ) 
     9	    {
    10		// declare and create an array of ints to parallel 
    11		// args array of Strings
    12		int[] a = new int[args.length];
    13	
    14		// fill it, using static Integer.parseInt method to convert
    15		// String to int: Integer.parseInt("1001") returns 1001
    16		for (int i = 0; i < args.length; i++ ) {
    17		    a[i] = Integer.parseInt( args[i] );
    18		}
    19	
    20		// standard idiom to sum the entries in an array
    21		int total = 0;
    22		for (int i = 0; i < a.length; i++ ) {	
    23		    total += a[i];   // total = total + a[i]
    24		}
    25		System.out.println("total: " + total);
    26	
    27		// find the maximum value 
    28		// start at -infinity, not at 0, since entries may be negative
    29		int maxSoFar = Integer.MIN_VALUE; 
    30		for (int i = 0; i < a.length; i++ ) {	
    31		    if ( a[i] > maxSoFar) {
    32			maxSoFar = a[i];
    33		    }
    34		}	
    35		System.out.println("maximum: " + maxSoFar);
    36	
    37		// finding the minimum value
    38		int minSoFar = Integer.MAX_VALUE; // start at infinity!
    39		for (int i = 0; i < a.length; i++ ) {	
    40		    minSoFar = Math.min( a[i], minSoFar );
    41		}
    42		System.out.println("minimum: " + minSoFar);
    43	    }
    44	}