private static int findMin(int[] array) {
int min = array[0];
for(int i=1;i<array.length;i++) {
if(min > array[i]) {
min = array[i];
}
}
return min;
}public static double arrayMax(double[] arr) {
double max = Double.NEGATIVE_INFINITY;
for(double cur: arr)
max = Math.max(max, cur);
return max;
} public static void main(String[] args) {
int[] xr = {2, 4, 1, 3, 7, 5, 6, 10, 8, 9};
//find maximum value
int max = xr[0];
for (int i = 0; i < xr.length; i++) {
if (xr[i] > max) {
max = xr[i];
}
}
//find minimum value
int min=xr[0];
for (int i = 0; i <xr.length ; i++) {
if (xr[i]<min){
min=xr[i];
}
}
System.out.println("max: "+max);
System.out.println("min: "+min);
}import java.util.Random;
public class Main {
public static void main(String[] args) {
int a[] = new int [100];
Random rnd = new Random ();
for (int i = 0; i< a.length; i++) {
a[i] = rnd.nextInt(99-0)+0;
System.out.println(a[i]);
}
int max = 0;
for (int i = 0; i < a.length; i++) {
a[i] = max;
for (int j = i+1; j<a.length; j++) {
if (a[j] > max) {
max = a[j];
}
}
}
System.out.println("Max element: " + max);
}
} Scanner input = new Scanner(System.in);
// Minimum And Maximum
int count = 0;
int min = 0;
int max = 0;
boolean bugSolved = true;
/* or we can use :
int min = Integer.MAX_VALUE;
int max = Integer.MIN_VALUE;
*/
while (true){
int cnt = count++;
System.out.print("Enter Number #"+(cnt+1)+": ");
boolean isValid = input.hasNextInt();
if(isValid){
int num = input.nextInt();
/* if (bugSolved){
bugSolved = false;
min = num;
max = num;
} # Just remove this condition and
boolean (bugSolved) at the top, if you use
int min = Integer.MAX_VALUE and int max =
Integer.MIN_VALUE */
if (num < min) {
min = num;
}else if (num > max){
max = num;
}
}else{
System.out.println("Invalid input..");
break;
}
input.nextLine();
}
System.out.println("Min Number : " + min);
System.out.println("Max Number : " + max);