11번*

공식1
package JavaFestival;

import java.util.Random;
import java.util.Scanner;

public class jar11 {

	public static void main(String[] args) {
		int[] sc = new int[8]; //생성자
		Random random = new Random(); // 랜덤
		
		System.out.print("배열에 있는 모든 값 : ");
		for(int i=0; i<8;i++) {
			sc[i]=random.nextInt(99)+1;
			System.out.print(sc[i]+" ");
		}
		int max=sc[0];
		int min=sc[0];
		for(int i=0; i<sc.length;i++) {
			if(max<sc[i]) {
				max=sc[i];
			}
			if(min>sc[i]) {
				min=sc[i];
			}
		}
		System.out.println();
		System.out.println("가장 큰 값 : " + max);
		System.out.println("가장 작은 값 : " + min);
	}
}

 

공식2
package JavaFestival;

import java.util.Arrays;
import java.util.Random;
import java.util.Scanner;
public class jar11 {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner sc = new Scanner(System.in);
		Random rd = new Random();
		
		int[] a = new int [8];
		
		System.out.print("배열이 있는 모든 값 : ");
		for(int i=0; i<a.length; i++) {
			a[i]=rd.nextInt(99)+1;
			System.out.print(a[i]+" ");
		}
		System.out.println();
		Arrays.sort(a);
		
		System.out.println("가장 큰 값 : " + a[7]);
		System.out.println("가장 작은 값 : " + a[0]);
	}

}