Java Program for Minimum product pair an array of positive Integers

// Java program to find minimum product of any two numbers in an array

import java.util.Arrays;

public class MinProductOfTwo {
      // Driver Code
    public static void main(String[] args) {
        int[] arr = { 11, 8, 5, 7, 5, 100 };
        int n = arr.length;
          
          // Function Call
        int minProduct = printMinimumProduct(arr);
        System.out.println(minProduct);
    }

     
    public static int printMinimumProduct(int[] arr) {
        int minProduct = Integer.MAX_VALUE;
      
          // loop through all possible pairs of array elements and find minimum product
        for (int i = 0; i < arr.length - 1; i++) {
            for (int j = i + 1; j < arr.length; j++) {
                int product = arr[i] * arr[j];
                  
                  // if minProduct is greater than the current product of 2 elements
                  // then update the minProduct with that one
                if (product < minProduct) {
                    minProduct = product;
                }
            }
        }
        
          // return minimum product
        return minProduct;
    }
}

// Java program to find the minimum product of any two
// numbers in an array

import java.util.Arrays;

public class GFG {
    // Function to find the minimum product of any two
    // numbers in an array
    static long findMinimumProduct(int[] arr) {
        int n = arr.length;
          
          // sort the array
        Arrays.sort(arr); 
      
          // return the product of first two
        // numbers
        return (long)arr[0] * arr[1]; 
    }
  
    // Driver code
    public static void main(String[] args) {
          // Input array
        int[] arr = { 11, 8 , 5 , 7 , 5 , 100 };
      
          // Function Call
        long minProduct = findMinimumProduct(arr);
      
          // Printing final answer
        System.out.println(minProduct);
    }
}