配列内で最大、最小、2番目に大きい、2番目に小さいを検索するJavaプログラム

配列内で最大、最小、2番目に大きい、2番目に小さいものを見つけるためのコードは、次のとおりです-

例

import java.util.*;
public class Demo {
   public static void main(String []args){
      int arr[] = {55, 10, 8, 90, 43, 87, 95, 25, 50, 12};
      System.out.println("Array = "+Arrays.toString(arr));
      Arrays.sort(arr);
      System.out.println("Sorted Array = "+Arrays.toString(arr));
      System.out.println("Smallest element = "+arr[0]);
      System.out.println("2nd Smallest element = "+arr[0]);
      System.out.println("Largest element = "+arr[9]);
      System.out.println("2nd Largest element = "+arr[8]);
   }
}

出力

Array = [55, 10, 8, 90, 43, 87, 95, 25, 50, 12]
Sorted Array = [8, 10, 12, 25, 43, 50, 55, 87, 90, 95]
Smallest element = 8
2nd Smallest element = 8
Largest element = 95
2nd Largest element = 90

例

別の例を見てみましょう：

import java.util.*;
public class Demo {
   public static void main(String []args){
      int a;
      int arr[] = {55, 10, 8, 90, 43, 87, 95, 25, 50, 12};
      System.out.println("Array = "+Arrays.toString(arr));
      int count = arr.length;
      for (int i = 0; i < count; i++) {
         for (int j = i + 1; j < count; j++) {
            if (arr[i] > arr[j]) {
               a = arr[i];
               arr[i] = arr[j];
               arr[j] = a;
            }
         }
      }
      System.out.println("Smallest: "+arr[0]);
      System.out.println("Largest: "+arr[count-1]);
      System.out.println("Second Smallest: "+arr[1]);
      System.out.println("Second Largest: "+arr[count-2]);
   }
}

出力

Array = [55, 10, 8, 90, 43, 87, 95, 25, 50, 12]
Smallest: 8
Largest: 95
Second Smallest: 10
Second Largest: 90