The complete program is given below.
As with the maximum-finding program, the trial minimum is initialized to the first (index 0) element of the array. Then it is updated as needed as each element of the array is inspected in the loop.
class MinAlgorithm { public static void main ( String[] args ) { int[] array = { -20, 19, 1, 5, -1, 27, 19, 5 } ; int min; // initialize the current minimum min = array[ 0 ]; // scan the array for ( int index=0; index < array.length; index++ ) { if ( array[ index ] < min ) min = array[ index ] ; } System.out.println("The minimum of this array is: " + min ); } }
Could an enhanced for loop be used in this program?