Question

Lab Description Write a program that will search through an array to find the smallest number. You must combine variables, ifs, and a loop to create a working method. There will always be at least one item in the list. Sample Data -99,1,2,3,4,5,6,7,8, 9,10,12345] [10,9,8,7,6,5,4,3,2,1-991 [10,20,30,40,50 -11818,40,30,20,10] 32767] [255, 255] 9,10-88,100,-555,10001 10,10,10,11,456] -111,1,2,3,9,11,20,30] 9, 8,7, 6,5,4,3,2,0-2,-989] [12,15, 18,21,23,1000] [250,19,17,15,13,11,10,9,6,3,2,1-4551 9,10,-8,10000,-5000,1000] Files Needed SmallestRunner.java RaySmallest.java Sample Output -99 -99 -11818 32767 255 -555 10 -989 -455 -5000

Answer 1

RaySmallest.java

public class RaySmallest{

public static int go(int[] ray){
// initial min
int min = ray[0];
// loop through ray
for(int i=1;i<ray.length;i++){
// check and update min
if(min > ray[i]){
min = ray[i];
}
}
return min;
}
}

SmallestRunner.java

public class SmallestRunner {

public static void main(String[] args) {

// declare arrays
int[] a = {-99,1,2,3,4,5,6,7,8,9,10,12345};
int[] b = {10,9,8,7,6,5,4,3,2,1,-99};
int[] l = {10,20,30,40,50,-11818,40,30,20,10};
int[] c = {32767};
int[] d = {255,255};
int[] e = {9,10,-88,100,-555,1000};
int[] f = {10,10,10,11,456};
int[] g = {-111,1,2,3,9,11,20,30};
int[] h = {9,8,7,6,5,4,3,2,0,-2,-989};
int[] i = {12,15,18,21,23,1000};
int[] j = {250,19,17,15,13,11,10,9,6,3,2,1,-455};
int[] k = {9,10,-8,10000,-5000,1000};

// call the go function with each array
System.out.println(RaySmallest.go(a));
System.out.println(RaySmallest.go(b));
System.out.println(RaySmallest.go(l));
System.out.println(RaySmallest.go(c));
System.out.println(RaySmallest.go(d));
System.out.println(RaySmallest.go(e));
System.out.println(RaySmallest.go(f));
System.out.println(RaySmallest.go(g));
System.out.println(RaySmallest.go(h));
System.out.println(RaySmallest.go(i));
System.out.println(RaySmallest.go(j));
System.out.println(RaySmallest.go(k));
}
}

/*
sample output

-99
-99
-11818
32767
255
-555
10
-111
-989
12
-455
-5000
*/